On NFAs Where All States are Final, Initial, or Both
classification
💻 cs.CC
cs.FL
keywords
finalinitialautomatainvolvingnfasproblemsstatesaccepted
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.