State complexity of basic language operations combined with reversal

We study the state complexity of combined operations on regular languages. Each of the combined operations is a basic operation combined with reversal. We show that their state complexities are all very different from the compositions of state complexities of individual operations.

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

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

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

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

[5]  Jeffrey E. F. Friedl.  Mastering Regular Expressions , 1997 .

[6]  Lauri Karttunen.  Applications of Finite-State Transducers in Natural Language Processing , 2000, CIAA.

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

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

[9]  Peter Linz,et al.  An Introduction to Formal Languages and Automata , 1997 .

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

[11]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

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

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

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

[15]  David Harel,et al.  Modeling Reactive Systems With Statecharts : The Statemate Approach , 1998 .

[16]  Lucian Ilie,et al.  Introduction to Process Traces , 2003, PDPTA.