Minimizing finite automata is computationally hard

Theoretical Computer Science

Volumn 327, Issue 3, 2004, Pages 375-390

  Malcher, Andreas ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

Finite automata; Limited nondeterminism; Minimization; NP complete

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

DETERMINISTIC FINITE AUTOMATA (DFA); LIMITED NONDETERMINISM;

FINITE AUTOMATA;

EID: 6344292220     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.03.070     Document Type: Conference Paper

References (16)

1. M.R. Garey, D.S. Johnson, Computers and Intractability, W.H. Freeman and Co., San Francisco, 1979.
2. A. Gill, L. Kou, Multiple-entry finite automata, J. Comput. System Sci. 9 (1974) 1-19.
3. E.M. Gold, Complexity of automaton identification from given data, Inform. Control 37 (3) (1978) 302-320.
4. J. Goldstine, C.M.R. Kintala, D. Wotschke, On measuring nondeterminism in regular languages, Inform. Comput. 86 (2) (1990) 179-194.
5. M. Holzer, K. Salomaa, S. Yu, On the state complexity of k-entry deterministic finite automata, J. Automata, Languages Combin. 6 (4) (2001) 453-466.
6. J.E. Hopcroft, An n log n algorithm for minimizing states in a finite automaton, in: Z. Kohavi (Ed.), Theory of Machines and Computations, Academic Press, New York, 1971, pp. 189-196.
7. J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading MA, 1979.
8. T. Jiang, B. Ravikumar, Minimal NFA problems are hard, SIAM J. Comput. 22 (6) (1993) 1117-1141.
9. N.D. Jones, Space-bounded reducibility among combinatorial problems, J. Comput. System Sci. 11 (1)(1975) 68-85.
10. N.D. Jones, E.Y. Lien, W.T. Laaser, New problems complete for nondeterministic log space, Math. Systems Theory 10 (1) (1976) 1-17.
11. M. Kappes, Descriptional complexity of deterministic finite automata with multiple initial states, J. Automata, Languages Combin. 5 (3) (2000) 269-278.
12. C.M.R. Kintala, D. Wotschke, Amounts of nondeterminism in finite automata, Acta Inform. 13 (2) (1980) 199-204.
13. H. Leung, On finite automata with limited nondeterminism, Acta Inform. 35 (7) (1998) 595-624.
14. A.R. Meyer, M.J. Fischer, Economy of descriptions by automata, grammars, and formal systems, IEEE Symp. Foundations of Computer Science, 1971, pp. 188-191.
15. L. Stockmeyer, A.R. Meyer, Word problems requiring exponential time: preliminary report, Fifth Ann. ACM Symp. Theory of Computing, 1973, pp. 1-9.
16. S. Yu, Regular languages, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Vol. 1, Springer, Berlin, Heidelberg, 1997, pp. 41-110.