Abstract
We study the complexity of the problem of converting a deterministic finite automaton (DFA) to a minimum equivalent nondeterministic finite automaton (NFA). More generally, let A → B denote the problem of converting a given FA of type A to a minimum FA of type B. We show that many of these optimal-conversion (or minimization) problems are computationally hard. We also study the complexity of decision problems for finite automata and present many fundamental decision problems which are computationally intractable even when the input is a DFA or a NFA with limited nondeterminism (such as unambiguous FA, or DFA's extended with one nondeterministic operation).
(Extended Abstract)
This work was supported in part by a grant from SERB, McMaster University, and NSERC Operating Grant OGP 0046613.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aho, A., J. Hopcroft and J. Ullman, The Design and Analysis of Computer Algorithms, 1973, Addison-Wesley, Reading, Massachusetts.
Chrobak, M., ‘Finite automata and unary languages', Theoretical Computer Science 47, 1986, 149–158.
Cook, S., ‘Complexity of theorem proving procedures', Proc. of 3rd Annual ACM Symp. on Theory of Computing, 1971, 151–158.
Garey, M. and D. Johnson, Computers and Intractability:A Guide to NP-Completeness, 1978, Freeman, San Fransisco.
Hopcroft, J. and J. Ullman, Introduction to Automata Theory, Languages and Computation, 1979, Addison-Wesley, Reading, Massachusetts.
Hunt, H., ‘On the time and tape complexity of languages', Proc. of 5th Annual ACM Symp. on Theory of Computing, 1973, 10–19.
Hunt, H. and D. Rosenkrantz, ‘Computational Parallels between regular and context-free languages', Proc. of 6th Annual ACM Symp. on Theory of Computing, 1974, 64–74.
Hunt H., D. Rosenkrantz and T. Szymanski, ‘On the equivalence, containment and covering problems for the regular and context-free languages', Jl. of Comp. and Sys. Sciences 12, 1976, 222–268.
Jiang, T., E. McDowell and B. Ravikumar, ‘The structure and complexity of minimal NFA's over a unary alphabet', University of Rhode Island Tech. Report, TR-200-90 (submitted).
Karp, R., ‘Reducibility among combinatorial problems', in R. E. Miller and J. W. Thatcher (eds.,), Complexity of Computer Computations, 1972, Plenum Press, NY, 85–103.
Kozen, D., ‘Lower bounds for natural proof systems', Proc. of 18th Annual IEEE Symp. on FOCS, 1977, 254–266.
Mandel, A. and I. Simon, ‘On finite semi-groups of matrices', Theoretical Computer Science 5, 1978, 183–204.
Meyer, A., and M. Fischer, ‘Economy of description by automata, grammars and formal systems', Proc. of 12th Annual IEEE Symp. on Switching and Auotmata Theory, 1971, IEEE Computer Society, Washington D.C., 188–191.
Meyer, A., and L. Stockmeyer, ‘The equivalence problem for regular expressions with squaring requires exponential space', Proc. of 13th Annual IEEE Symp. on Switching and Automata Theory, 1972, IEEE Computer Society, 125–129.
Myhill, J., ‘Finite automata and the representation of events', WADD TR-57-624, 112–137, 1957, Wright Patterson AFB, Ohio.
Nerode, A., ‘Linear automaton transformations', Proc. of AMS 9, 1958, 541–544.
Reutenauer, C., ‘Propietes arithmetiques et topologiques de series rationelles en variables noncommutatives', These troisieme cycle, 1977, Université de Paris VI, Paris, France.
Rabin, M. and D. Scott, ‘Finite automata and their decision problems', IBM Journal of Res. and Development 3, 1959, 114–125.
Ravikumar, B. and O. Ibarra, ‘Relating the type of ambiguity to the succinctness of their representations', SIAM Journal on Computing 18, 1989, 1263–1282.
Rivest, R. and R. Schapire, ‘Diversity-based inference of finite automata', Proc. of 28th Annual Symp. on FOCS, 1987, 78–87.
Salomaa, A., Jewels of Formal Language Theory, 1981, Computer Science Press.
Schapire, R., ‘Diversity based inference of finite automata', Master's thesis, MIT Laboratory for Computer Science, May 1988. Tech. Report MIT/LCS/TR-413.
Stearns, R., and H. Hunt, ‘On the equivalence and containment problems for unambiguous regular expressions, regular grammars and finite automata', SIAM Jl. on Computing 14, 1985, 598–611.
Stockmeyer, L. and A. Meyer, ‘Word problems requiring exponential time’ (prelim. report), Proc. of 5th Annual ACM symposium on Theory of Computing, 1973, 1–9.
Stockmeyer, L., ‘Set basis problem is NP-complete', Report No. RC-5431, 1976, IBM Research Center, Yorktown Heights, NY.
Thompson, K., ‘Regular expression searching algorithm', Communications of ACM, 11:6, 1968, 419–422.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jiang, T., Ravikumar, B. (1991). Minimal NFA problems are hard. In: Albert, J.L., Monien, B., Artalejo, M.R. (eds) Automata, Languages and Programming. ICALP 1991. Lecture Notes in Computer Science, vol 510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54233-7_169
Download citation
DOI: https://doi.org/10.1007/3-540-54233-7_169
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54233-9
Online ISBN: 978-3-540-47516-3
eBook Packages: Springer Book Archive