State complexity of combined operations

[1]  Cheng-Nan Lai,et al.  Two conditions for reducing the maximal length of node-disjoint paths in hypercubes , 2012, Theor. Comput. Sci..

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

[3]  Jozef Jirásek,et al.  State complexity of concatenation and complementation , 2005, Int. J. Found. Comput. Sci..

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

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

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

[7]  Michael Domaratzki,et al.  Deletion along trajectories , 2004, Theor. Comput. Sci..

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

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

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

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

[12]  Sheng Yu,et al.  On the State Complexity of k-Entry Deterministic Finite Automata , 2001, J. Autom. Lang. Comb..

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

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

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

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

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

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

[19]  Jean-Camille Birget,et al.  Partial Orders on Words, Minimal Elements of Regular Languages and State Complexity , 1993, Theor. Comput. Sci..

[20]  Galina Jirásková,et al.  State Complexity of Some Operations on Regular Languages , 2003, DCFS.

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

[22]  Michael Domaratzki,et al.  State Complexity and Proportional Removals , 2001, DCFS.

[23]  Sheng Yu,et al.  State Complexity of Regular Languages: Finite versus Infinite , 2000, Finite Versus Infinite.

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

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