State Complexity and Approximation

We discuss a number of essential questions concerning the state complexity research. The questions include why many basic problems were not studied earlier, whether there is a general algorithm for...

[1]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

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

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

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

[5]  George Anton Kiraz,et al.  Compressed Storage of Sparse Finite-State Transducers , 1999, WIA.

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

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

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

[9]  Grzegorz Rozenberg,et al.  Cornerstones of undecidability , 1994, Prentice Hall International Series in Computer Science.

[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]  Arto Salomaa,et al.  Undecidability of the State Complexity of Composed Regular Operations , 2011, LATA.

[12]  Martin Kutrib,et al.  Nondeterministic Descriptional Complexity Of Regular Languages , 2003, Int. J. Found. Comput. Sci..

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

[14]  Ivar Jacobson,et al.  The unified modeling language reference manual , 2010 .

[15]  Kai Salomaa,et al.  Synchronization Expressions with Extended Join Operation , 1998, Theor. Comput. Sci..

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

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

[18]  I. N. Sneddon,et al.  Theory Of Automata , 1969 .

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

[20]  Michael Domaratzki,et al.  Lower bounds for the transition complexity of NFAs , 2008, J. Comput. Syst. Sci..

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

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

[23]  Ferhat Khendek,et al.  Test Selection Based on Finite State Models , 1991, IEEE Trans. Software Eng..

[24]  Michael Domaratzki,et al.  Transition complexity of language operations , 2007, Theor. Comput. Sci..

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

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

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