How can an arbitrary non-deterministic finite automate be converted into one with only one accept stage? If so, what is the proof that this can always be done?
Can every non-deterministic finite automate be changed into one with only one acceptance state?
fl.formal languages;automata theory
If you allow $\epsilon$ transitions, then the answer is yes. Simply introduce a new accepting state and have epsilon transitions from the original accepting states to it.Proof is by construction.