Operations on Automata with All States Final

Galina Jir\'askov\'a; Juraj \v{S}ebej; Krist\'ina \v{C}evorov\'a; Mat\'u\v{s} Palmovsk\'y; Peter Mlyn\'ar\v{c}ik

arxiv: 1405.5603 · v1 · pith:OWTZPPHYnew · submitted 2014-05-22 · 💻 cs.FL

Operations on Automata with All States Final

Krist\'ina \v{C}evorov\'a , Galina Jir\'askov\'a , Peter Mlyn\'ar\v{c}ik , Mat\'u\v{s} Palmovsk\'y , Juraj \v{S}ebej This is my paper

classification 💻 cs.FL

keywords languagesautomatacomplexityfinalincompletenondeterministicoperationsprefix-closed

0 comments

read the original 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.

This paper has not been read by Pith yet.

Operations on Automata with All States Final

discussion (0)