a. Let A be an innite regular language. Prove that A can
Chapter , Problem 1.63(choose chapter or problem)
a. Let A be an innite regular language. Prove that A can be split into two innite disjoint regular subsets. b. Let B and D be two languages. Write B b D if B D and D contains innitely many strings that are not in B. Show that if B and D are two regular languages where B b D, then we can nd a regular language C where B b C b D.
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