State Complexity of Two Combined Operations: Catenation-Star and Catenation-Reversal

This paper is a continuation of our research work on state complexity of combined operations. Motivated by applications, we study the state complexities of two particular combined operations: catenation combined with star and catenation combined with reversal. We show that the state complexities of both of these combined operations are considerably less than the compositions of the state complexities of their individual participating operations.

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

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

[3]  Martyn Amos,et al.  Theoretical and Experimental DNA Computation , 1999, Bull. EATCS.

[4]  Jeffrey D. Ullman,et al.  Introduction to automata theory, languages, and computation, 2nd edition , 2001, SIGA.

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

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

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

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

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

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

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

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

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

[14]  Martyn Amos,et al.  Theoretical and Experimental DNA Computation (Natural Computing Series) , 2005 .

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

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

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

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

[19]  Michael Domaratzki,et al.  State Complexity of Orthogonal Catenation , 2008, DCFS.

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

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

[22]  Yuan Gao,et al.  State Complexity of Catenation Combined with Star and Reversal , 2010, DCFS.

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