On NFAs Where All States are Final, Initial, or Both
Computational Complexity
2009-07-03 v2 Formal Languages and Automata Theory
Abstract
We examine questions involving nondeterministic finite automata where all states are final, initial, or both initial and final. First, we prove hardness results for the nonuniversality and inequivalence problems for these NFAs. Next, we characterize the languages accepted. Finally, we discuss some state complexity problems involving such automata.
Keywords
Cite
@article{arxiv.0808.2417,
title = {On NFAs Where All States are Final, Initial, or Both},
author = {Jui-Yi Kao and Narad Rampersad and Jeffrey Shallit},
journal= {arXiv preprint arXiv:0808.2417},
year = {2009}
}
Comments
submitted