2000 character limit reached
On NFAs Where All States are Final, Initial, or Both (0808.2417v2)
Published 18 Aug 2008 in cs.CC and cs.FL
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.