A Family of NFA’s Which Need 2nα Deterministic States

  • Kazuo Iwama
  • Akihiro Matsuura
  • Mike Paterson
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1893)


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.


Neighboring State Magic Number Finite Automaton Neighboring Pair Deterministic State 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M. Rabin and D. Scott, “Finite automata and their decision problems,” IBM J. Res. Develop. 3, pp. 114–125, 1959.MathSciNetCrossRefGoogle Scholar
  2. 2.
    O. B. Lupanov, “Uber den Vergleich zweier Typen endlicher Quellen,” Probleme der Kybernetik, Vol. 6, pp. 329–335, Akademie-Verlag, Berlin, 1966.Google Scholar
  3. 3.
    F. Moore, “On the bounds for state-set size in the proofs of equivalence between deterministic, nondeterministic, and two-way finite automata,” IEEE Trans. Comput. C-20, pp. 1211–1214, 1971.CrossRefGoogle Scholar
  4. 4.
    J. E. Hopcroft and J. D. Ullman, Introduction to automata theory, languages and computation, Addison-Wesley, 1979.Google Scholar
  5. 5.
    K. Iwama, Y. Kambayashi, and K. Takaki, “Tight bounds on the number of states of DFA’s that are equivalent to n-state NFA’s,” Theoretical Computer Science, to appear. (

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Kazuo Iwama
    • 1
  • Akihiro Matsuura
    • 1
  • Mike Paterson
    • 2
  1. 1.School of InformaticsKyoto UniversityJapan
  2. 2.Department of Computer ScienceUniversity of WarwickUK

Personalised recommendations