in Theory of Computation
1,064 views
0 votes
0 votes
Prove that every $\text{NFA}$ can be converted to an equivalent one that has a single accept state.
in Theory of Computation
by
1.1k views

1 Answer

1 vote
1 vote
From every final state of the NFA we can add an Ɛ-transition to a new state and make it the final state, and make all the previous final states to non final states. Hopefully this'd work.

Related questions