The chop of languages

Abstract We investigate chop operations, which can be seen as generalized concatenation. For several language families of the Chomsky hierarchy we prove (non)closure properties under chop operations and incomparability to the family of languages that are the chop of two regular languages. We also prove non-closure of that language family under Boolean operations and closure under reversal. Further, the representation of a regular language as the chop of two regular expressions can be exponentially more succinct than its regular expression. By considering the chop of two linear context-free languages we already obtain language families that have non-semi-decidable problems such as emptiness or finiteness.

[1]  Rina S. Cohen,et al.  Star Height of Certain Families of Regular Events , 1970, J. Comput. Syst. Sci..

[2]  Seymour Ginsburg,et al.  Algebraic and Automata Theoretic Properties of Formal Languages , 1975 .

[3]  Friedrich Otto,et al.  Growing Context-Sensitive Languages and Church-Rosser Languages , 1995, STACS.

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

[5]  Martin Kutrib.  The phenomenon of non-recursive trade-offs , 2004, Int. J. Found. Comput. Sci..

[6]  L. Eggan.  Transition graphs and the star-height of regular events. , 1963 .

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

[8]  William F. Ogden,et al.  A helpful result for proving inherent ambiguity , 1968, Mathematical systems theory.

[9]  Brenda S. Baker,et al.  Reversal-Bounded Multipushdown Machines , 1974, J. Comput. Syst. Sci..

[10]  Paliath Narendran,et al.  Church-Rosser Thue systems and formal languages , 1988, JACM.

[11]  Juris Hartmanis,et al.  On Gödel Speed-Up and Succinctness of Language Representations , 1983, Theor. Comput. Sci..

[12]  Kosaburo Hashiguchi,et al.  Homomorphisms That Preserve Star Height , 1976, Inf. Control..

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

[14]  Martin Kutrib,et al.  Descriptional Complexity - An Introductory Survey , 2010, Scientific Applications of Language Methods.

[15]  Oscar H. Ibarra,et al.  Closure and decidability properties of some language classes with respect to ciliate bio-operations , 2003, Theor. Comput. Sci..

[16]  Oscar H. Ibarra,et al.  The LD and DLAD Bio-Operations on Formal Languages , 2003, J. Autom. Lang. Comb..

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

[18]  Markus Holzer,et al.  Finite Automata, Digraph Connectivity, and Regular Expression Size , 2008, ICALP.

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

[20]  Juris Hartmanis.  On the Succinctness of Different Representations of Languages , 1980, SIAM J. Comput..

[21]  Robert McNaughton,et al.  The loop complexity of regular events , 1969, Inf. Sci..

[22]  Mark Daley,et al.  Families of languages defined by ciliate bio-operations , 2004, Theor. Comput. Sci..

[23]  Gerhard Buntrock,et al.  Growing Context-Sensitive Languages and Church-Rosser Languages , 1998, Inf. Comput..

[24]  Michael Domaratzki,et al.  Semantic Shuffle on and Deletion Along Trajectories , 2004, Developments in Language Theory.

[25]  Ion Petre,et al.  Self-assembly of strings and languages , 2007, Theor. Comput. Sci..

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

[27]  A. R. Meyer,et al.  Economy of Description by Automata, Grammars, and Formal Systems , 1971, SWAT.

[28]  Friedrich Otto,et al.  The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages , 2005, Inf. Comput..

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

[30]  Juris Hartmanis.  Context-free languages and turing machine computations , 1967 .

[31]  Martin Kutrib.  On the descriptional power of heads, counters, and pebbles , 2005, Theor. Comput. Sci..