Question: Prove that for every TG there is another TG that accepts the same language but has only one + state.
Prove that for every TG there is another TG that accepts the same language but has only one + state.
Step by Step Solution
3.37 Rating (163 Votes )
There are 3 Steps involved in it
1 Let L be a language accepted by TG TG 2 We will construct another TG TG that accepts L and has onl... View full answer
Get step-by-step solutions from verified subject matter experts
