State Complexity of Regular Languages

State complexity is a descriptive complexity measure for regular languages. We investigate the problems related to the state complexity of regular languages and their operations. In particular, we compare the state complexity results on regular languages with those on nite languages.

[1]  N. S. Barnett,et al.  Private communication , 1969 .

[2]  Sergei Vasiliev,et al.  TURUN YLIOPISTON JULKAISUJA ANNALES UNIVERSITATIS TURKUENSIS , 2022 .

[3]  Karel Culik,et al.  State Complexity of Basic Operations on Finite Languages , 1999, WIA.

[4]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[5]  Oscar H. Ibarra,et al.  Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation , 1989, SIAM J. Comput..

[6]  William E. Lorensen,et al.  Object-Oriented Modeling and Design , 1991, TOOLS.

[7]  B. Ravikumar,et al.  Some applications of a technique of Sakoda and Sipser , 1990, SIGA.

[8]  Tao Jiang,et al.  Minimal NFA Problems are Hard , 1991, SIAM J. Comput..

[9]  Ernst L. Leiss,et al.  Succint Representation of Regular Languages by Boolean Automata , 1981, Theor. Comput. Sci..

[10]  FRANK R. MOORE,et al.  On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata , 1971, IEEE Transactions on Computers.

[11]  강문설.  [서평]「The Unified Modeling Language User Guide」 , 1999 .

[12]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[13]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[14]  Rusins Freivalds,et al.  Minimal Nontrivial Space Complexity of Probabilistic One-Way Turing Machines , 1990, MFCS.

[15]  Sheng Yu,et al.  Minimal cover-automata for finite languages , 1998, Theor. Comput. Sci..

[16]  Jeffrey Shallit,et al.  Automaticity: Properties of a Measure of Descriptional Complexity , 1994, STACS.

[17]  Robert McNaughton,et al.  The theory of automata , 1961 .

[18]  Jeffrey Shallit,et al.  Automaticity I: Properties of a Measure of Descriptional Complexity , 1996, J. Comput. Syst. Sci..

[19]  Sheng Yu,et al.  The State Complexities of Some Basic Operations on Regular Languages , 1994, Theor. Comput. Sci..

[20]  Dominique Revuz,et al.  Minimisation of Acyclic Deterministic Automata in Linear Time , 1992, Theor. Comput. Sci..

[21]  A. R. Meyer,et al.  Economy of Description by Automata, Grammars, and Formal Systems , 1971, SWAT.