Show that there is no finite-state automaton with three
Chapter , Problem 38E(choose chapter or problem)
Problem 38E
Show that there is no finite-state automaton with three states that recognizes the set of bit strings containing an even number of 1 s and an even number of 0s.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer