论文信息 - A family of NFAs which need 2n- deterministic states

A family of NFAs which need 2n- deterministic states

We show that for all integers n?7 and ?, such that 5???2n?2 and satisfying some coprimality conditions, there exists a minimum n-state nondeterministic finite automaton that is equivalent to a minimum deterministic finite automaton with exactly 2n?? states.

Mike Paterson | Akihiro Matsuura | Kazuo Iwama

[1] Christos H. Papadimitriou,et al. Elements of the Theory of Computation , 1997, SIGA.

[2] 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.

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

[4] M. W. Shields. An Introduction to Automata Theory , 1988 .

[5] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[6] Galina Jirásková. Note on Minimal Finite Automata , 2001, MFCS.

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

[8] Arto Salomaa,et al. Computation and Automata , 1984 .