Show that there is no finite-state automaton with two
Chapter , Problem 37E(choose chapter or problem)
Problem 37E
Show that there is no finite-state automaton with two states that recognizes the set of all bit strings that have one or more 1s bits and end with a 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