Show that there is no finite-state automaton that recognizes the set of bit strings containing an equal

Question:

Show that there is no finite-state automaton that recognizes the set of bit strings containing an equal number of 0s and 1s.
Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

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