Abstract
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.
This research was supported by VEGA grant No. 2/7007/2.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Chrobak: Finite automata and unary languages. Theoretical Computer Science 47(1986), 149–158
J. Hromkovič: Communication Complexity and Parallel Computing. Springer 1997
J. Hromkovič, J. Karhumäki, H. Klauck, S. Seibert, G. Schnitger: Measures on nondeterminism in finite automata. In: ICALP’00, Lecture Notes in Computer Science 1853, Springer-Verlag 2000, pp. 199–210
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 237(2000) 485–494
K. Iwama. A. Matsuura and M. Paterson: A family of NFA’s which need 2n-α deterministic states. Proc. MFCS’00, Lecture Notes in Computer Science 1893, Springer-Verlag 2000, pp. 436–445
F. Moore: On the bounds for state-set size in proofs of equivalence between deterministic, nondeterministic and two-way finite automata. IEEE Trans. Comput. C-20, pp. 1211–1214, 1971
O. B. Lupanov: Uber der Vergleich zweier Typen endlicher Quellem. Probleme der Kybernetik, Vol. 6, pp. 329–335, Akademie-Verlag, Berlin, 1966
M. Rabin and D. Scott: Finite automata and their decision problems. IBM J. Res. Develop, 3, pp. 114–129, 1959
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jirásková, G. (2001). Note on Minimal Finite Automata. In: Sgall, J., Pultr, A., Kolman, P. (eds) Mathematical Foundations of Computer Science 2001. MFCS 2001. Lecture Notes in Computer Science, vol 2136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44683-4_37
Download citation
DOI: https://doi.org/10.1007/3-540-44683-4_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42496-3
Online ISBN: 978-3-540-44683-5
eBook Packages: Springer Book Archive