State complexity of chop operations on unary and finite languages

Authors:
Markus Holzer;Sebastian Jakobi
Affiliations:
Institut für Informatik, Universität Giessen, Giessen, Germany;Institut für Informatik, Universität Giessen, Giessen, Germany
Venue:
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Year:
2012

Citing 7
Cited 0

Intersection and union of regular languages and state complexity

Information Processing Letters
The state complexities of some basic operations on regular languages

Theoretical Computer Science
A lower bound technique for the size of nondeterministic finite automata

Information Processing Letters
State Complexity of Basic Operations on Finite Languages

WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Minimality in template-guided recombination

Information and Computation
Finite automata and their decision problems

IBM Journal of Research and Development
Chop operations and expressions: descriptional complexity considerations

DLT'11 Proceedings of the 15th international conference on Developments in language theory

Quantified Score

Hi-index	0.00

Visualization

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.