Let E = {hMi
Chapter , Problem 4.27(choose chapter or problem)
Let E = {hMi| M is a DFA that accepts some string with more 1s than 0s}. Show that E is decidable. (Hint: Theorems about CFLs are helpful here.)
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