Descriptional and computational complexity of finite automata - A survey

Information and Computation

Volumn 209, Issue 3, 2011, Pages 456-470

  Holzer, Markus ^a   Kutrib, Martin ^a  

^a JUSTUS LIEBIG UNIVERSITY   (Germany)

Author keywords

Alternation; Computational complexity; Descriptional complexity; Determinism; Finite automata; Nondeterminism; Survey

Indexed keywords

ALTERNATION; DESCRIPTIONAL COMPLEXITY; DETERMINISM; NON-DETERMINISM; REGULAR LANGUAGES;

CONTEXT FREE LANGUAGES; SURVEYS;

COMPUTATIONAL COMPLEXITY;

EID: 79751524882     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2010.11.013     Document Type: Article

References (88)

1. H.N. Adorna Some descriptional complexity problems in finite automata theory Philippine Computing Science Congress (PCSC 2005) 2005 Computing Society of the Philippines
2. A.V. Aho, J.E. Hopcroft, and J.D. Ullman The Design and Analysis of Computer Algorithms 1974 Addison-Wesley pp. 27-32
3. C. Álvarez, and B. Jenner A very hard log-space counting class Theoret. Comput. Sci. 107 1993 3 30
4. 1 formulae on finite structures Ann. Pure. Appl. Logic 24 1983 1 48
5. J. Amilhastre, P. Janssen, and M.C. Vilarem FA minimisation heuristics for a class of finite languages Workshop on Implementing Automata (WIA 2001) LNCS vol. 2214 2001 Springer 1 12 (Pubitemid 33359640)
6. T. Anderson, J. Loftus, N. Rampersad, N. Santean, and J. Shallit Detecting palindroms, patterns, and borders in regular languages Inform. and Comput. 207 2009 1096 1118
7. D.A. Barrington Bounded-width polynomial-size branching programs recognize exactly those languages in NC 1 J. Comput. System Sci. 38 1989 150 164
8. D.A.M. Barrington, N. Immerman, and H. Straubing On uniformity within NC 1 J. Comput. System Sci. 41 1990 274 306
9. D.M. Barrington, and D. Thérien Finite monoids and the fine structure of NC 1 J. ACM 35 1988 941 952
10. J.C. Birget Intersection and union of regular languages and state complexity Inform. Process. Lett. 43 1992 85 190
11. H. Björklund, and W. Martens The tractability frontier for NFA minimization International Colloqium on Automata, Languages and Programming (ICALP 2008) LNCS vol. 5126 2008 Springer 27 38
12. J. Brzozowski, J. Shallit, and Z. Xu Decision problems for convex languages Language and Automata Theory and Applications (LATA 2009) LNCS vol. 5457 2009 Springer 247 258
13. J.A. Brzozowski, and E.L. Leiss On equations for regular languages, finite automata, and sequential networks Theoret. Comput. Sci. 10 1980 19 35
14. A. Chandra, D. Kozen, and L. Stockmeyer Alternation J. ACM 21 1981 114 133
15. S. Cho, and D.T. Huynh Finite-automaton aperiodicity is PSPACE-complete Theoret. Comput. Sci. 88 1991 99 116
16. S. Cho, and D.T. Huynh The parallel complexity of finite-state automata problems Inform. and Comput. 97 1992 1 22
17. M. Chrobak Finite automata and unary languages Theoret. Comput. Sci. 47 1986 149 158
18. M. Chrobak Errata to "finite automata and unary languages" Theoret. Comput. Sci. 302 2003 497 498
19. R.S. Cohen, and J.A. Brzozowski Dot-depth of star-free events J. Comput. System Sci. 5 1971 1 16
20. C. Damm, M. Holzer, and K.J. Lange The parallel complexity of iterated morphisms and the arithmetic of small numbers Mathematical Foundations of Computer Science (MFCS 1992) LNCS vol. 629 1992 Springer 227 235
21. C. Damm, M. Holzer, K.J. Lange, and P. Rossmanith Deterministic 0L Languages are of very Low Complexity: D0L is in AC 0 Developments in Language Theory (DLT 1994) 1994 World Scientific pp. 305-313
22. S. Eilenberg Automata, Languages, and Machines (Volume 59-B) 1976 Academic Press
23. A. Fellah, H. Jürgensen, and S. Yu Constructions for alternating finite automata Int. J. Comput. Math. 35 1990 117 132
24. M.L. Furst, J.B. Saxe, and M. Sipser Parity, circuits, and the polynomial-time hierarchy Math. Systems Theory 17 1984 13 27
25. Z. Galil Hierarchies of complete problems Acta Inform. 6 1976 77 88
26. M.R. Garey, and D.S. Johnson Computers and Intractability A Guide to the Theory of NP-Completeness 1979 Freeman
27. I. Glaister, and J. Shallit A lower bound technique for the size of nondeterministic finite automata Inform. Process. Lett. 59 1996 75 77 (Pubitemid 126375635)
28. E.M. Gold Complexity of automaton identification from given data Inform. Control 37 1978 302 320
29. G. Gramlich Probabilistic and nondeterministic unary automata Mathematical Foundations of Computer Science (MFCS 2003) LNCS vol. 2747 2003 Springer 460 469
30. G. Gramlich, and G. Schnitger Minimizing NFA's and regular expressions Symposium on Theoretical Aspects of Computer Science (STACS 2005) LNCS vol. 3404 2005 Springer 399 411 (Pubitemid 41241264)
31. S. Greibach A note on undecidable properties of formal languages Math. Systems Theory 2 1 1968 1 6
32. H. Gruber, and M. Holzer Finding lower bounds for nondeterministic state complexity is hard (extended abstract) Developments in Language Theory (DLT 2006) LNCS vol. 4036 2006 Springer 363 374 (Pubitemid 44089635)
33. H. Gruber, M. Holzer, Computational complexity of NFA minimization for finite and unary languages, in: Language and Automata Theory and Applications (LATA 2007), Technical Report 35/07, Universitat Rovira i Virgili, Tarragona, 2007, pp. 261-272.
34. H. Gruber, and M. Holzer Inapproximability of nondeterministic state and transition complexity assuming P ≠ NP Developments in Language Theory (DLT 2007) LNCS vol. 4588 2007 Springer 205 216 (Pubitemid 47290275)
35. Hartmanis, J., Hunt III, H.B., The LBA problem and its importance in the theory of computing, in: SIAM AMS Vol. 7 on Complexity of Computing, 1974, 1-26.
36. M. Holzer On Emptiness and Counting for Alternating Finite Automata Developments in Language Theory (DLT 1996) 1996 World Scientific pp. 88-97
37. M. Holzer, and M. Kutrib Nondeterministic descriptional complexity of regular languages Int. J. Found. Comput. Sci. 14 2003 1087 1102
38. M. Holzer, and M. Kutrib Nondeterministic finite automata - recent results on the descriptional and computational complexity Int. J. Found. Comput. Sci. 20 2009 563 580
39. M. Holzer, K. Salomaa, and S. Yu On the state complexity of k-entry deterministic finite automata J. Autom. Lang. Comb. 6 2001 453 466
40. J. Hopcroft An nlogn Algorithm for Minimizing the State in a Finite Automaton The Theory of Machines and Computations 1971 Academic Press pp. 189-196
41. J.E. Hopcroft, and J.D. Ullman Introduction to Automata Theory, Languages and Computation 1979 Addison-Wesley
42. J. Hromkovič Communication Complexity and Parallel Computing 1997 Springer
43. J. Hromkovič, and G. Schnitger On the hardness of determining small NFA's and of proving lower bounds on their sizesm Developments in Language Theory (DLT 2008) LNCS vol. 5257 2008 Springer 34 55
44. H.B. Hunt III, On the time and tape complexity of languages, Ph.D. Thesis, Cornell University, Ithaca, New York, USA, 1973.
45. H.B. Hunt III On the time and tape complexity of languages I Symposium on Theory of Computing (STOC 1973) 1973 ACM Press 10 19
46. H.B. Hunt III Observations on the complexity of regular expressions problems J. Comput. System Sci. 19 1979 222 236
47. H.B. Hunt III, and D.J. Rosenkrantz On equivalence and contaiment problems for formal languages J. ACM 24 1977 387 396
48. H.B. Hunt III, and D.J. Rosenkrantz Computational parallels between the regular and context-free languages SIAM J. Comput. 7 1978 99 114
49. H.B. Hunt III, D.J. Rosenkrantz, and T.G. Szymanski On the equivalence, containment, and covering problems for the regular and context-free languages J. Comput. System Sci. 12 1976 222 268
50. D.T. Huynh Complexity of Closeness Sparseness and Segment Equivalence for Context-free and Regular Languages Informatik Festschrift zum 60 Geburtstag von Günter Hotz 1992 Teubner pp. 235-251
51. O.H. Ibarra, and B. Ravikumar On sparseness ambiguity and other decision problems for acceptors and transducers Symposium on Theoretical Aspects of Computer Science (STACS 1986) LNCS vol. 210 1986 Springer 171 179
52. L. Ilie, and S. Yu Follow automata Inform. and Comput. 186 2003 140 162
53. N. Immerman Nondeterministic space is closed under complementation SIAM J. Comput. 17 1988 935 938
54. T. Jiang, E. McDowell, and B. Ravikumar The structure and complexity of minimal NFAs over a unary alphabet Internat. J. Found. Comput. Sci. 2 1991 163 182
55. T. Jiang, and B. Ravikumar A note on the space complexity of some decision problems for finite automata Inform. Process. Lett. 40 1991 25 31
56. T. Jiang, and B. Ravikumar Minimal NFA problems are hard SIAM J. Comput. 22 1993 1117 1141
57. N. Jones Space-bounded reducibility among combinatorial problems J. Comput. System Sci. 11 1975 68 85
58. J.Y. Kao, A. Malton, N. Rampersad, and J. Shallit On NFA's where all states are final, initial, or both Theoret. Comput. Sci. 410 2009 5010 5021
59. J. Köbler, U. Schöning, and J. Torán On counting and approximation Acta Inform. 26 1989 363 379
60. D. Kozen Lower Bounds for Natural Proof Systems Foundations of Computer Science (FOCS 1977) 1977 IEEE Press
61. S.Y. Kuroda Classes of languages and linear bounded automata Inform. Control 7 1964 207 223
62. E. Landau Über die Maximalordnung der Permutationen gegebenen Grades Archiv der Math. und Phys. 3 1903 92 103
63. E. Landau Handbuch der Lehre von der Verteilung der Primzahlen 1909 Teubner
64. K.J. Lange, and P. Rossmanith The emptiness problem for intersections of regular languages Mathematical Foundations of Computer Science (MFCS 1992) LNCS vol. 629 1992 Springer 346 354
65. E. Leiss Succinct representation of regular languages by Boolean automata Theoret. Comput. Sci. 13 1981 323 330
66. E. Leiss Succinct representation of regular languages by Boolean automata. II Theoret. Comput. Sci. 38 1985 133 136 (Pubitemid 15584047)
67. A. Malcher Minimizing finite automata is computationally hard Theoret. Comput. Sci. 327 2004 375 390
68. P. McKenzie, P. Péladeau, and D. Thérien NC 1 : The automata-theoretical viewpoint Comput. Complexity 1 1991 330 359
69. R. McNaughton, and S. Papert Counter-free Automata Research Monographs vol. 65 1971 MIT Press
70. C. Mereghetti, and G. Pighizzini Optimal simulations between unary automata SIAM J. Comput. 30 2001 1976 1992 (Pubitemid 34125445)
71. A.R. Meyer, and M.J. Fischer Economy of description by automata, grammars, and formal systems IEEE Symposium on Switching and Automata Theory (SWAT 1971) 1971 IEEE Press 188 191
72. A.R. Meyer, and L.J. Stockmeyer The equivalence problem for regular expressions with squaring requires exponential time Symposium on Switching and Automata Theory (SWAT 1972) 1972 IEEE Press 125 129
73. B. Monien On the LBA problem Fundamentals on Computation Theory (FCT 1981) LNCS vol. 117 1981 Springer 265 280
74. F.R. Moore On the bounds for state-set size in the proofs of equivalence between deterministic, nondeterministic, and two-way finite automata IEEE Trans. Comput. 20 1971 1211 1214
75. M.O. Rabin, and D. Scott Finite automata and their decision problems IBM J. Res. Dev. 3 1959 114 125
76. R.L. Rivest, and R.E. Schapire Diversity-based Inference of Finite Automata (Extended Abstract) Foundations of Computer Science (FOCS 1987) 1987 IEEE Press pp. 78-87
77. G. Rozenberg, and A. Salomaa The Mathematical Theory of L Systems Pure and Applied Mathematics vol. 90 1980 Academic Press
78. M.P. Schützenberger On finite monoids having only trivial subgroups Inform. Control 8 1965 190 194
79. M. Sipser Lower bounds on the size of sweeping automata J. Comput. System Sci. 21 1980 195 202
80. R.E. Stearns, and H.B. Hunt III On the equivalence and containment problems for unambiguous regular expressions, regular grammars, and finite automata SIAM J. Comput. 14 1985 598 611 (Pubitemid 16460999)
81. J. Stern Complexity of some problems from the theory of automata Inform. Control 66 1985 163 176 (Pubitemid 16490700)
82. L.J. Stockmeyer, The Complexity of Decision Problems in Automata Theory and Logic, Ph.D. Thesis, MIT, Cambridge, Massasuchets, USA, 1974.
83. L.J. Stockmeyer, and A.R. Meyer Word problems requiring exponential time Symposium on Theory of Computing (STOC 1973) 1973 ACM Press 1 9
84. R. Szelepcsényi The method of forced enumeration for nondeterministic automata Acta Inform. 26 1988 279 284
85. D. Thérien Classification of finite monoids: the language approach Theoret. Comput. Sci. 14 1981 195 208
86. L.G. Valiant The complexity of computing the permanent Theoret. Comput. Sci. 8 2 1979 189 201
87. S. Yu State complexity of regular languages J. Autom. Lang. Comb. 6 2001 221 234
88. S. Yu Regular Languages Handbook of Formal Languages 1 1997 Springer pp. 41-110