Back to Search
Start Over
On NFAs where all states are final, initial, or both
- Source :
-
Theoretical Computer Science . Nov2009, Vol. 410 Issue 47-49, p5010-5021. 12p. - Publication Year :
- 2009
-
Abstract
- 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. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 410
- Issue :
- 47-49
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 44584563
- Full Text :
- https://doi.org/10.1016/j.tcs.2009.07.049