State Complexity of Chop Operations on Unary and Finite Languages

We continue our research on the descriptional complexity of chop operations. Informally, the chop of two words is like their concatenation with the touching letters merged if they are equal, otherwise their chop is undefined. The iterated variants chop-star and chop-plus are defined similar as the classical operations Kleene star and plus. We investigate the state complexity of chop operations on unary and/or finite languages, and obtain similar bounds as for the classical operations.

[1]  Paritosh K. Pandya,et al.  Chop Expressions and Discrete Duration Calculus , 2012, Modern Applications of Automata Theory.

[2]  Arto Salomaa,et al.  Parallel Composition of Words with Re-entrant Symbols , 1996 .

[3]  Michael Domaratzki.  Minimality in template-guided recombination , 2009, Inf. Comput..

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

[5]  Ernst L. Leiss,et al.  Succint Representation of Regular Languages by Boolean Automata , 1981, Theor. Comput. Sci..

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

[7]  Jean-Camille Birget,et al.  Intersection and Union of Regular Languages and State Complexity , 1992, Inf. Process. Lett..

[8]  Grzegorz Rozenberg,et al.  Developments in Language Theory II , 2002 .

[9]  Martin Kutrib,et al.  The chop of languages , 2017, Theor. Comput. Sci..

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

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

[12]  Dana S. Scott,et al.  Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[13]  Masami Ito,et al.  Generalized periodicity and primitivity for words , 2007, Math. Log. Q..

[14]  Markus Holzer,et al.  Chop Operations and Expressions: Descriptional Complexity Considerations , 2011, Developments in Language Theory.