Portal de Periódicos da CAPES

On NFAs where all states are final, initial, or both

2009; Elsevier BV; Volume: 410; Issue: 47-49 Linguagem: Inglês

10.1016/j.tcs.2009.07.049

1879-2294

Jui-Yi Kao, Narad Rampersad, Jeffrey Shallit,

Formal Methods in Verification

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.