Let A = {hMi
Chapter , Problem 4.12(choose chapter or problem)
Let A = {hMi| M is a DFA that doesnt accept any string containing an odd number of 1s}. Show that A is decidable.
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