Chop Operations and Expressions: Descriptional Complexity Considerations

The chop or fusion operation was recently introduced in [S. A. BABU, P. K. PANDYA: Chop Expressions and Discrete Duration Calculus. Modern Applications of Automata Theory, World Scientific, 2010], where a characterization of regular languages in terms of chop expressions was shown. Simply speaking, the chop or fusion of two words is a concatenation were the touching letters are coalesced, if both letters are equal; otherwise the operation is undefined. We investigate the descriptional complexity of the chop operation and its iteration for deterministic and nondeterministic finite automata as well as for regular expressions. In most cases tight bounds are shown. Moreover, we also consider the conversion problem between finite automata, regular expressions, and chop expressions. Again, for most conversions we get tight bounds in order of magnitude. It is worth mentioning that regular expressions can be transformed into equivalent chop expressions of polynomial size, but chop expressions can be exponentially more succinct than regular expressions.

[1]  Manfred Kufleitner,et al.  First-order fragments with successor over infinite words , 2010, STACS 2010.

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

[3]  Borivoj Melichar,et al.  Finding Common Motifs with Gaps Using Finite Automata , 2006, CIAA.

[4]  Elaine Rich,et al.  Automata, Computability and Complexity: Theory and Applications , 2007 .

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

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

[7]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

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

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

[10]  Markus Holzer,et al.  State Complexity of Chop Operations on Unary and Finite Languages , 2012, DCFS.

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

[12]  Kosaburo Hashiguchi,et al.  Algorithms for Determining Relative Star height and Star Height , 1988, IFIP Congress.

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

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

[15]  V. Glushkov.  THE ABSTRACT THEORY OF AUTOMATA , 1961 .

[16]  Andrzej Ehrenfeucht,et al.  Complexity Measures for Regular Expressions , 1976, J. Comput. Syst. Sci..

[17]  FRANK R. MOORE,et al.  On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata , 1971, IEEE Transactions on Computers.

[18]  David Peleg,et al.  Process Logic with Regular Formulas , 1985, Theor. Comput. Sci..

[19]  Ken Thompson,et al.  Programming Techniques: Regular expression search algorithm , 1968, Commun. ACM.

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

[21]  Markus Holzer,et al.  Language Operations with Regular Expressions of Polynomial Size , 2008, DCFS.

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

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

[24]  Edward J. McCluskey,et al.  Signal Flow Graph Techniques for Sequential Circuit State Diagrams , 1963, IEEE Trans. Electron. Comput..

[25]  Deepak D'Souza,et al.  Modern Applications of Automata Theory , 2012, IISc Research Monographs Series.

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

[27]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[28]  Jacques Sakarovitch,et al.  The Language, the Expression, and the (Small) Automaton , 2005, CIAA.

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

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