Minimizing finite automata is computationally hard

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2710, Issue , 2003, Pages 386-397

  Malcher, Andreas ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

DETERMINISTIC FINITE AUTOMATA; DETERMINISTIC MODELING; MINIMIZATION PROBLEMS; NON-DETERMINISM; NONDETERMINISTIC FINITE AUTOMATON; NUMBER OF STATE; PSPACE-COMPLETE; TIME COMPLEXITY;

FINITE AUTOMATA;

EID: 24544481888     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45007-6_31     Document Type: Article

References (15)

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