Let BALDFA = {hMi
Chapter , Problem 4.25(choose chapter or problem)
Let BALDFA = {hMi| M is a DFA that accepts some string containing an equal number of 0s and 1s}. Show that BALDFA 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