On NFAs Where All States are Final, Initial, or Both

Details On NFAs Where All States are Final, Initial, or Both On NFAs Where All States are Final, Initial, or Both

2008-08-18

arxiv.org/abs/0808.2417v2

Computer Science

Computational Complexity

submitted

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On NFAs Where All States are Final, Initial, or Both does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On NFAs Where All States are Final, Initial, or Both, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On NFAs Where All States are Final, Initial, or Both will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-698638