Complexity in Prefix-Free Regular Languages
Formal Languages and Automata Theory
2010-08-11 v1
Abstract
We examine deterministic and nondeterministic state complexities of regular operations on prefix-free languages. We strengthen several results by providing witness languages over smaller alphabets, usually as small as possible. We next provide the tight bounds on state complexity of symmetric difference, and deterministic and nondeterministic state complexity of difference and cyclic shift of prefix-free languages.
Cite
@article{arxiv.1008.1662,
title = {Complexity in Prefix-Free Regular Languages},
author = {Galina Jirásková and Monika Krausová},
journal= {arXiv preprint arXiv:1008.1662},
year = {2010}
}
Comments
In Proceedings DCFS 2010, arXiv:1008.1270