Operations on Automata with All States Final

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 compleme...

Full description

Bibliographic Details
Main Authors: Kristína Čevorová, Galina Jirásková, Peter Mlynárčik, Matúš Palmovský, Juraj Šebej
Format: Article
Language:English
Published: Open Publishing Association 2014-05-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/1405.5603v1