A family of NFAs which need 2n−α deterministic states
- 14 May 2003
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 301 (1-3) , 451-462
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Note on Minimal Finite AutomataLecture Notes in Computer Science, 2001
- Tight bounds on the number of states of DFAs that are equivalent to n-state NFAsTheoretical Computer Science, 2000
- On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite AutomataIEEE Transactions on Computers, 1971
- Finite Automata and Their Decision ProblemsIBM Journal of Research and Development, 1959