Algorithms for determining relative star height and star height
Information and Computation
Intersection and union of regular languages and state complexity
Information Processing Letters
Programming Techniques: Regular expression search algorithm
Communications of the ACM
State complexity of regular languages
Journal of Automata, Languages and Combinatorics
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Automata Theory and Applications
Automata Theory and Applications
Finite Automata, Digraph Connectivity, and Regular Expression Size
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Economy of description by automata, grammars, and formal systems
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Language operations with regular expressions of polynomial size
Theoretical Computer Science
Minimality in template-guided recombination
Information and Computation
Finite automata and their decision problems
IBM Journal of Research and Development
Complexity measures for regular expressions
Journal of Computer and System Sciences
Star height of certain families of regular events
Journal of Computer and System Sciences
The language, the expression, and the (small) automaton
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
On inverse operations and their descriptional complexity
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
State complexity of chop operations on unary and finite languages
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
| Hi-index | 0.00 |
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.