Prove that for every TG there is another TG that accepts the same language but has only

Question:

Prove that for every TG there is another TG that accepts the same language but has only one + state.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: