Operations on Automata with All States Final
Formal Languages and Automata Theory
2014-05-23 v1
Abstract
We study the complexity of basic regular operations on languages represented by incomplete deterministic or nondeterministic automata, in which all states are final. Such languages are known to be prefix-closed. We get tight bounds on both incomplete and nondeterministic state complexity of complement, intersection, union, concatenation, star, and reversal on prefix-closed languages.
Keywords
Cite
@article{arxiv.1405.5603,
title = {Operations on Automata with All States Final},
author = {Kristína Čevorová and Galina Jirásková and Peter Mlynárčik and Matúš Palmovský and Juraj Šebej},
journal= {arXiv preprint arXiv:1405.5603},
year = {2014}
}
Comments
In Proceedings AFL 2014, arXiv:1405.5272