State Complexity of Chop Operations on Unary and Finite Languages
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.
KeywordsTransition Function State Complexity Regular Language Reachable State Sink State
Unable to display preview. Download preview PDF.
- 1.Babu, S.A., Pandya, P.K.: Chop expressions and discrete duration calculus. In: Modern Applications of Automata Theory. IISc research Monographs Series, vol. 2. World Scientific (2010)Google Scholar
- 8.Holzer, M., Jakobi, S., Kutrib, M.: The chop of languages. In: Automata and Formal Languages (AFL), Debrecen, Hungary, pp. 197–210 (2011)Google Scholar