Transition complexity of language operations

The number of transitions required by a nondeterministic finite automaton (NFA) to accept a regular language is a natural measure of the size of that language. There has been a significant amount of work related to the trade-off between the number of transitions and other descriptional complexity measures for regular languages. In this paper, we consider the effect of language operations on the number of transitions required to accept a regular language. This work extends previous work on descriptional complexity of regular language operations, in particular, under the measures of deterministic state complexity, nondeterministic state complexity and regular expression size.

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

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

[3]  Juraj Hromkovic,et al.  NFAs With and Without epsilon-Transitions , 2005, ICALP.

[4]  Jeffrey Shallit,et al.  Non-Uniqueness and Radius of Cyclic Unary NFAs , 2004, DCFS.

[5]  Yuri Lifshits.  A lower bound on the size of [epsiv]-free NFA corresponding to a regular expression , 2003, Inf. Process. Lett..

[6]  Thomas Wilke,et al.  Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata , 1997, STACS.

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

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

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

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

[11]  Georg Schnitger,et al.  Regular Expressions and NFAs Without epsilon-Transitions , 2006, STACS.

[12]  Jeffrey Shallit,et al.  Regular Expressions: New Results and Open Problems , 2004, J. Autom. Lang. Comb..

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

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

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

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

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

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

[19]  Viliam Geffert.  Translation of binary regular expressions into nondeterministic [epsiv]-free automata with transitions , 2003, J. Comput. Syst. Sci..