A Survey on Operational State Complexity

Descriptional complexity is the study of the conciseness of the various models representing formal languages. The state complexity of a regular language is the size, measured by the number of states of the smallest, either deterministic or nondeterministic, finite automaton that recognises it. Operational state complexity is the study of the state complexity of operations over languages. In this survey, we review the state complexities of individual regularity preserving language operations on regular and some subregular languages. Then we revisit the state complexities of the combination of individual operations. We also review methods of estimation and approximation of state complexity of more complex combined operations.

[1]  Yuan Gao,et al.  Estimation of state complexity of combined operations , 2009, Theor. Comput. Sci..

[2]  Annett Baier.  Programming Language Pragmatics , 2016 .

[3]  Markus Holzer,et al.  On the average state and transition complexity of finite languages , 2007, Theor. Comput. Sci..

[4]  Yo-Sub Han,et al.  State complexity of basic operations on suffix-free regular languages , 2009, Theor. Comput. Sci..

[5]  Juraj Hromkovic,et al.  Descriptional Complexity of Finite Automata: Concepts and Open Problems , 2002, J. Autom. Lang. Comb..

[6]  J. Conway.  Regular algebra and finite machines , 1971 .

[7]  Jeffrey Shallit,et al.  A Lower Bound Technique for the Size of Nondeterministic Finite Automata , 1996, Inf. Process. Lett..

[8]  Janusz A. Brzozowski,et al.  Syntactic Complexity of Ideal and Closed Languages , 2010, Developments in Language Theory.

[9]  Derick Wood,et al.  On the state complexity of reversals of regular languages , 2004, Theor. Comput. Sci..

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

[11]  Galina Jirásková,et al.  State complexity of some operations on binary regular languages , 2005, Theor. Comput. Sci..

[12]  Pascal Caron,et al.  State complexity of multiple catenation , 2016, ArXiv.

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

[14]  Jozef Jirásek,et al.  On the boundary of regular languages , 2015, Theor. Comput. Sci..

[15]  Martin Kutrib,et al.  Descriptional and computational complexity of finite automata - A survey , 2011, Inf. Comput..

[16]  Tomás Masopust,et al.  Complexity in Union-Free Regular Languages , 2010, Int. J. Found. Comput. Sci..

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

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

[19]  Martin Kutrib,et al.  Unary Language Operations and Their Nondeterministic State Complexity , 2002, Developments in Language Theory.

[20]  B. G. Mirkin,et al.  On dual automata , 1966 .

[21]  Yuan Gao,et al.  State Complexity of Combined Operations with Two Basic Operations , 2022 .

[22]  Arto Salomaa,et al.  State complexity of combined operations , 2007, Theor. Comput. Sci..

[23]  Nelma Moreira,et al.  A Hitchhiker's Guide to descriptional complexity through analytic combinatorics , 2014, Theor. Comput. Sci..

[24]  Yuan Gao,et al.  State Complexity of Combined Operations with Union, Intersection, Star and Reversal , 2012, Fundam. Informaticae.

[25]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[26]  Janusz A. Brzozowski,et al.  Unrestricted State Complexity of Binary Operations on Regular and Ideal Languages , 2017, J. Autom. Lang. Comb..

[27]  Cyril Nicaud,et al.  On the Average Size of Glushkov's Automata , 2009, LATA.

[28]  Robert McNaughton,et al.  Regularity-Preserving Relations , 1976, Theor. Comput. Sci..

[29]  Jeffrey Shallit,et al.  State Complexity and the Monoid of Transformations of a Finite Set , 2004, CIAA.

[30]  Yuan Gao,et al.  State Complexity of Two Combined Operations: Catenation-Star and Catenation-Reversal , 2012, Int. J. Found. Comput. Sci..

[31]  Moreira Davide,et al.  DesCo: a Knowledge Based System for Descriptional Complexity of Formal Languages , 2013 .

[32]  Alexander Okhotin,et al.  State complexity of cyclic shift , 2008, RAIRO Theor. Informatics Appl..

[33]  Janusz A. Brzozowski,et al.  Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Languages , 2010, Acta Cybern..

[34]  Peter Mlynárcik,et al.  Complement on Free and Ideal Languages , 2015, DCFS.

[35]  Janusz A. Brzozowski.  In Search of Most Complex Regular Languages , 2013, Int. J. Found. Comput. Sci..

[36]  Martin Kutrib,et al.  Determination of finite automata accepting subregular languages , 2009, Theor. Comput. Sci..

[37]  Galina Jirásková,et al.  Magic Numbers and Ternary Alphabet , 2009, Int. J. Found. Comput. Sci..

[38]  Markus Holzer,et al.  State Complexity of Chop Operations on Unary and Finite Languages , 2012, DCFS.

[39]  Kristína Cevorová.  Kleene Star on Unary Regular Languages , 2013, DCFS.

[40]  Sheng Yu,et al.  NFA to DFA Transformation for Finite Languages over Arbitrary Alphabets , 1998, J. Autom. Lang. Comb..

[41]  Cezar Câmpeanu,et al.  The Maximum State Complexity for Finite Languages , 2004, J. Autom. Lang. Comb..

[42]  L. H. Haines.  On free monoids partially ordered by embedding , 1969 .

[43]  Juraj Sebej,et al.  Prefix-Free Languages: Right Quotient and Reversal , 2014, DCFS.

[44]  Giovanni Pighizzini,et al.  Complementing unary nondeterministic automata , 2005, Theor. Comput. Sci..

[45]  Janusz A. Brzozowski,et al.  Derivatives of Regular Expressions , 1964, JACM.

[46]  Juraj Sebej.  Reversal of regular languages and state complexity , 2010, ITAT.

[47]  Galina Jirásková,et al.  On the Square of Regular Languages , 2014, CIAA.

[48]  Jeffrey D. Ullman,et al.  Worst-case analysis of memory allocation algorithms , 1972, STOC.

[49]  Galina Jirásková,et al.  State Complexity of Intersection and Union of Suffix-Free Languages and Descriptional Complexity , 2009, NCMA.

[50]  Marcel Paul Schützenberger,et al.  On Finite Monoids Having Only Trivial Subgroups , 1965, Inf. Control..

[51]  Derick Wood,et al.  Operational State Complexity of Prefix-Free Regular Languages , 2009, Automata, Formal Languages, and Related Topics.

[52]  Emanuele Rodaro,et al.  State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages , 2010, Developments in Language Theory.

[53]  Martin Kutrib,et al.  The chop of languages , 2017, Theor. Comput. Sci..

[54]  Sheng Yu,et al.  State Complexity of Regular Languages , 2001, J. Autom. Lang. Comb..

[55]  Yuan Gao,et al.  State Complexity of Two Combined Operations: Catenation-Union and Catenation-Intersection , 2011, Int. J. Found. Comput. Sci..

[56]  Jozef Jirásek,et al.  State Complexity of Concatenation and Complementation of Regular Languages , 2004, CIAA.

[57]  Kai Salomaa,et al.  Descriptional Complexity of Nondeterministic Finite Automata , 2007, Developments in Language Theory.

[58]  Galina Jirásková.  Concatenation of Regular Languages and Descriptional Complexity , 2009, CSR.

[59]  Mehryar Mohri,et al.  On some applications of finite-state automata theory to natural language processing , 1996, Nat. Lang. Eng..

[60]  Lawrence T. Kou,et al.  Multiple-Entry Finite Automata , 1974, J. Comput. Syst. Sci..

[61]  Martin Kutrib,et al.  Descriptional and Computational Complexity of Finite Automata , 2009, LATA.

[62]  Martin Kutrib,et al.  Nondeterministic Finite Automata-Recent Results on the Descriptional and Computational Complexity , 2008, CIAA.

[63]  Alexander Okhotin,et al.  On the State Complexity of Scattered Substrings and Superstrings , 2010, Fundam. Informaticae.

[64]  Grzegorz Rozenberg,et al.  Shuffle on Trajectories: Syntactic Constraints , 1998, Theor. Comput. Sci..

[65]  Nelma Moreira,et al.  Enumeration and generation with a string automata representation , 2007, Theor. Comput. Sci..

[66]  Janusz A. Brzozowski,et al.  Quotient Complexity of Ideal Languages , 2010, LATIN.

[67]  Kai Salomaa,et al.  Nondeterministic State Complexity of Proportional Removals , 2013, DCFS.

[68]  Janusz A. Brzozowski,et al.  Syntactic Complexities of Some Classes of Star-Free Languages , 2012, DCFS.

[69]  Sheng Yu,et al.  State Complexity of Combined Operations for Prefix-Free Regular Languages , 2009, LATA.

[70]  Giovanni Pighizzini.  Unary Language Concatenation and Its State Complexity , 2000, CIAA.

[71]  Cyril Nicaud,et al.  Average State Complexity of Operations on Unary Automata , 1999, MFCS.

[72]  Martin Kutrib,et al.  The Magic Number Problem for Subregular Language Families , 2010, DCFS.

[73]  Galina Jirásková,et al.  Union and Intersection of Regular Languages and Descriptional Complexity , 2005, DCFS.

[74]  Jeffrey Shallit,et al.  State complexity of unique rational operations , 2009, Theor. Comput. Sci..

[75]  Dana S. Scott,et al.  Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[76]  Janusz A. Brzozowski.  Unrestricted State Complexity of Binary Operations on Regular Languages , 2016, DCFS.

[77]  Viliam Geffert.  State Hierarchy for One-Way Finite Automata , 2007, J. Autom. Lang. Comb..

[78]  Narad Rampersad.  The state complexity of L2 and Lk , 2006, Inf. Process. Lett..

[79]  Janusz A. Brzozowski,et al.  Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals , 2014, Developments in Language Theory.

[80]  Jean-Éric Pin,et al.  Syntactic Semigroups , 1997, Handbook of Formal Languages.

[81]  Juraj Sebej,et al.  Reversal on Regular Languages and Descriptional Complexity , 2013, DCFS.

[82]  Yo-Sub Han,et al.  State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages , 2013, Int. J. Found. Comput. Sci..

[83]  José Luis Roda García,et al.  Parallel dynamic programming and automata theory , 2000, Parallel Comput..

[84]  Kai Salomaa,et al.  On the State Complexity of Combined Operations and their Estimation , 2007, Int. J. Found. Comput. Sci..

[85]  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.

[86]  Kristína Cevorová.  Square on closed languages , 2016, NCMA.

[87]  Janusz A. Brzozowski,et al.  Maximally Atomic Languages , 2014, AFL.

[88]  Martin Kutrib,et al.  The size of Higman-Haines sets , 2007, Theor. Comput. Sci..

[89]  Laura Giambruno,et al.  The Average State Complexity of Rational Operations on Finite Languages , 2010, Int. J. Found. Comput. Sci..

[90]  Arto Salomaa,et al.  Undecidability of the State Complexity of Composed Regular Operations , 2011, LATA.

[91]  Sheng Yu,et al.  Tight Lower Bound for the State Complexity of Shuffle of Regular Languages , 2002, J. Autom. Lang. Comb..

[92]  Sheng Yu,et al.  State Complexity of Finite and Infinite Regular Languages , 2002, Bull. EATCS.

[93]  Galina Jirásková.  Note on Minimal Finite Automata , 2001, MFCS.

[94]  Janusz A. Brzozowski,et al.  Quotient Complexity of Closed Languages , 2013, Theory of Computing Systems.

[95]  David S. Johnson,et al.  Fast Allocation Algorithms , 1972, SWAT.

[96]  Michael Riley,et al.  Speech Recognition by Composition of Weighted Finite Automata , 1996, ArXiv.

[97]  Shou-Feng Wang,et al.  𝒫𝒮-regular languages , 2011, Int. J. Comput. Math..

[98]  Gabriel Thierrin.  Convex Languages , 1972, ICALP.

[99]  Galina Jirásková,et al.  On the State Complexity of Complements, Stars, and Reversals of Regular Languages , 2008, Developments in Language Theory.

[100]  Nelma Moreira,et al.  On the Average Size of Glushkov and Partial derivative Automata , 2012, Int. J. Found. Comput. Sci..

[101]  Janusz A. Brzozowski,et al.  Complexity in Convex Languages , 2010, LATA.

[102]  David S. Johnson,et al.  Near-optimal bin packing algorithms , 1973 .

[103]  Viliam Geffert,et al.  Magic numbers in the state hierarchy of finite automata , 2006, Inf. Comput..

[104]  Janusz A. Brzozowski,et al.  Complexity of Prefix-Convex Regular Languages , 2016, ArXiv.

[105]  Jiacun Wang,et al.  Handbook of Finite State Based Models and Applications , 2012 .

[106]  Mike Paterson,et al.  A family of NFAs which need 2n- deterministic states , 2003, Theor. Comput. Sci..

[107]  Janusz A. Brzozowski,et al.  Theory of átomata , 2011, Theor. Comput. Sci..

[108]  Ernst L. Leiss.  Succinct Representation of Regular Languages by Boolean Automata II , 1985, Theor. Comput. Sci..

[109]  Tomás Masopust,et al.  State Complexity of Projected Languages , 2011, DCFS.

[110]  Stavros Konstantinidis,et al.  State-Complexity Hierarchies of Uniform Languages of Alphabet-Size Length , 2009, DCFS.

[111]  Narad Rampersad.  The state complexity of L^2 and L^k , 2004 .

[112]  Yuan Gao,et al.  The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal , 2008, Fundam. Informaticae.

[113]  Richard Edwin Stearns,et al.  Regularity Preserving Modifications of Regular Expressions , 1963, Inf. Control..

[114]  Bo Liu,et al.  On the State Complexity of the Shuffle of Regular Languages , 2016, DCFS.

[115]  Yuan Gao,et al.  State Complexity of Star and Square of Union of k Regular Languages , 2012, DCFS.

[116]  Cyril Nicaud,et al.  Brzozowski Algorithm Is Generically Super-Polynomial for Deterministic Automata , 2013, Developments in Language Theory.

[117]  Juraj Sebej,et al.  The Complexity of Languages Resulting from the Concatenation Operation , 2016, DCFS.

[118]  Janusz A. Brzozowski,et al.  Most Complex Regular Right-Ideal Languages , 2014, DCFS.

[119]  A. Luca,et al.  Some combinatorial properties of factorial languages , 1990 .

[120]  Alexander Okhotin,et al.  On the State Complexity of Star of Union and Star of Intersection , 2011, Fundam. Informaticae.

[121]  Yuan Gao,et al.  State complexity of union and intersection of star on k regular languages , 2012, Theor. Comput. Sci..

[122]  Yo-Sub Han,et al.  State Complexity of Union and Intersection of Finite Languages , 2007, Developments in Language Theory.

[123]  Juraj Hromkovic,et al.  Communication Complexity and Parallel Computing , 1997, Texts in Theoretical Computer Science An EATCS Series.

[124]  Tomás Masopust,et al.  On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs , 2012, CIAA.

[125]  Michael Domaratzki,et al.  Orthogonal Concatenation: Language Equations and State Complexity , 2010, J. Univers. Comput. Sci..

[126]  Jean-Camille Birget.  Intersection of regular languages and state complexity , 1991, SGAR.

[127]  Yo-Sub Han,et al.  Nondeterministic State Complexity for Suffix-Free Regular Languages , 2010, DCFS.

[128]  Derick Wood,et al.  Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages , 2009, Fundam. Informaticae.

[129]  Bezalel Peleg,et al.  Ultimate-Definite and Symmetric-Definite Events and Automata , 1965, JACM.

[130]  Zhi Xu,et al.  Decision problems for convex languages , 2008, Inf. Comput..

[131]  Barbara König,et al.  On deterministic finite automata and syntactic monoid size , 2003, Theor. Comput. Sci..

[132]  Juraj Sebej,et al.  Note on Reversal of Binary Regular Languages , 2011, DCFS.

[133]  Viliam Geffert.  (Non)determinism and the Size of One-Way Finite Automata , 2005, DCFS.

[134]  Martin Kutrib,et al.  More on the Size of Higman-Haines Sets: Effective Constructions , 2007, Fundam. Informaticae.

[135]  Yuan Gao,et al.  State Complexity Approximation , 2009, DCFS.

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

[137]  Galina Jirásková,et al.  Complexity in Prefix-Free Regular Languages , 2010, DCFS.

[138]  Martin Kutrib,et al.  State complexity of basic operations on nondeterministic finite automata , 2002, CIAA'02.

[139]  Marek Chrobak,et al.  Errata to: "finite automata and unary languages" , 2003 .

[140]  Markus Holzer,et al.  Chop Operations and Expressions: Descriptional Complexity Considerations , 2011, Developments in Language Theory.

[141]  Yuan Gao,et al.  State complexity of union and intersection of square and reversal on k regular languages , 2012, Theor. Comput. Sci..

[142]  Yuan Gao,et al.  State Complexity and Approximation , 2012, Int. J. Found. Comput. Sci..

[143]  Jeffrey Shallit,et al.  Decimations of languages and state complexity , 2009, Theor. Comput. Sci..

[144]  Jeffrey Shallit,et al.  The State Complexity of Star-Complement-Star , 2012, Developments in Language Theory.

[145]  Pierre-Cyrille Héam,et al.  On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism , 2015, CIAA.

[146]  Carlo Mereghetti,et al.  Optimal Simulations Between Unary Automata , 1998, STACS.

[147]  Galina Jirásková,et al.  Nondeterministic Complexity of Operations on Closed and Ideal Languages , 2016, CIAA.

[148]  Galina Jirásková,et al.  Complement on Prefix-Free, Suffix-Free, and Non-Returning NFA Languages , 2014, DCFS.

[149]  Yahiko Kambayashi,et al.  Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs , 2000, Theor. Comput. Sci..

[150]  Frédérique Bassino,et al.  Enumeration and random generation of accessible automata , 2007, Theor. Comput. Sci..

[151]  Sheng Yu,et al.  Are Statecharts Finite Automata? , 2009, CIAA.

[152]  Sheng Yu.  State Complexity: Recent Results and Open Problems , 2005, Fundam. Informaticae.

[153]  Tomás Masopust,et al.  On the State Complexity of the Reverse of - and -Trivial Regular Languages , 2013, DCFS.

[154]  Yuan Gao.  Advanced Topics on State Complexity of Combined Operations , 2010 .

[155]  Laura Giambruno,et al.  Complexity of Operations on Cofinite Languages , 2010, LATIN.

[156]  Carlos Martín-Vide,et al.  State complexity of basic language operations combined with reversal , 2008, Inf. Comput..

[157]  Dominique Perrin,et al.  Codes and Automata , 2009, Encyclopedia of mathematics and its applications.

[158]  Janusz A. Brzozowski,et al.  Syntactic Complexity of ℛ- and 풥-Trivial Regular Languages , 2014, Int. J. Found. Comput. Sci..

[159]  Michael Domaratzki,et al.  State Complexity of Proportional Removals , 2002, J. Autom. Lang. Comb..

[160]  Michael Domaratzki,et al.  State Complexity of Shuffle on Trajectories , 2002, DCFS.

[161]  Juraj Sebej,et al.  Kleene Closure on Regular and Prefix-Free Languages , 2014, CIAA.

[162]  Martin Kutrib,et al.  Descriptional Complexity of Bounded Regular Languages , 2016, DCFS.

[163]  Cyril Nicaud,et al.  On the Average Complexity of Brzozowski's Algorithm for Deterministic Automata with a Small Number of Final States , 2014, Developments in Language Theory.

[164]  Martin Kutrib,et al.  Nondeterministic state complexity of star-free languages , 2012, Theor. Comput. Sci..

[165]  Janusz A. Brzozowski,et al.  Languages Convex with Respect to Binary Relations, and Their Closure Properties , 2009, Acta Cybern..

[166]  Janusz A. Brzozowski,et al.  Quotient Complexities of Atoms of Regular Languages , 2012, Developments in Language Theory.

[167]  Janusz A. Brzozowski,et al.  Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages , 2012, Theor. Comput. Sci..

[168]  Jeffrey Shallit,et al.  Unary Language Operations, State Complexity and Jacobsthal's Function , 2002, Int. J. Found. Comput. Sci..

[169]  Narad Rampersad,et al.  On NFAs where all states are final, initial, or both , 2008, Theor. Comput. Sci..

[170]  Janusz A. Brzozowski,et al.  Most Complex Regular Ideals , 2015, ArXiv.

[171]  Michael Domaratzki,et al.  State complexity of power , 2009, Theor. Comput. Sci..

[172]  Nelma Moreira,et al.  Universal Disjunctive Concatenation and Star , 2015, DCFS.

[173]  Nelma Moreira,et al.  On the Average State Complexity of Partial derivative Automata: an analytic Combinatorics Approach , 2011, Int. J. Found. Comput. Sci..

[174]  Marek Chrobak,et al.  Finite Automata and Unary Languages , 1986, Theor. Comput. Sci..

[175]  Yuan Gao,et al.  Transition Complexity of Incomplete DFAs , 2010, Fundam. Informaticae.

[176]  Sheng Yu,et al.  On the state complexity of intersection of regular languages , 1991, SIGA.

[177]  Janusz A. Brzozowski,et al.  Large Aperiodic Semigroups , 2013, Int. J. Found. Comput. Sci..

[178]  R. McNaughton,et al.  Counter-Free Automata , 1971 .

[179]  Juraj Sebej,et al.  Star-Complement-Star on Prefix-Free Languages , 2015, DCFS.

[180]  Jozef Jirásek,et al.  Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet , 2007, Developments in Language Theory.

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

[182]  Janusz A. Brzozowski,et al.  Complexity of suffix-free regular languages , 2015, J. Comput. Syst. Sci..

[183]  Philippe Schnoebelen,et al.  On the State Complexity of Closures and Interiors of Regular Languages with Subwords , 2014, DCFS.

[184]  Bo Liu,et al.  Quotient Complexity of Star-Free Languages , 2010, Int. J. Found. Comput. Sci..

[185]  Janusz Brzozowski,et al.  Quotient Complexity of Regular Languages , 2009, J. Autom. Lang. Comb..

[186]  Cyril Nicaud,et al.  Random Generation of Deterministic Acyclic Automata Using the Recursive Method , 2013, CSR.

[187]  Stavros Konstantinidis,et al.  State Complexity of the Subword Closure Operation with Applications to DNA Coding , 2008, Int. J. Found. Comput. Sci..