论文信息 - Note on Minimal Finite Automata

Note on Minimal Finite Automata

We show that for all n and α such that 1 ≤ n ≤ α ≤ 2n there is a minimal n-state nondeterministic finite automaton whose equivalent minimal deterministic automaton has exactly α states.

Galina Jirásková

[1] Marek Chrobak,et al. Finite Automata and Unary Languages , 1986, Theor. Comput. Sci..

[2] Dana S. Scott,et al. Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[3] Wilhelm Kämmerer,et al. Probleme der Kybernetik , 1962 .

[4] Yahiko Kambayashi,et al. Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs , 2000, Theor. Comput. Sci..

[5] FRANK R. MOORE,et al. On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata , 1971, IEEE Transactions on Computers.

[6] Hartmut Klauck,et al. Measures of Nondeterminism in Finite Automata , 2000, ICALP.

[7] Juraj Hromkovic,et al. Communication Complexity and Parallel Computing , 1997, Texts in Theoretical Computer Science An EATCS Series.

[8] Mike Paterson,et al. A family of NFAs which need 2n- deterministic states , 2003, Theor. Comput. Sci..

[9] Mike Paterson,et al. A Family of NFA's Which Need 2n -alpha Deterministic States , 2000, MFCS.