0 votes 0 votes Prove that every $\text{NFA}$ can be converted to an equivalent one that has a single accept state. Theory of Computation michael-sipser theory-of-computation finite-automata proof + – admin asked Apr 21, 2019 admin 1.1k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes 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. Arkaprava answered May 8, 2019 Arkaprava comment Share Follow See all 0 reply Please log in or register to add a comment.