Abstract
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. © 2012 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Holzer, M., & Jakobi, S. (2012). State complexity of chop operations on unary and finite languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7386 LNCS, pp. 169–182). https://doi.org/10.1007/978-3-642-31623-4_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
