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. © 2011 Springer-Verlag.
CITATION STYLE
Holzer, M., & Jakobi, S. (2011). Chop operations and expressions: Descriptional complexity considerations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6795 LNCS, pp. 264–275). https://doi.org/10.1007/978-3-642-22321-1_23
Mendeley helps you to discover research relevant for your work.