Question: a. Let A be an infinite regular language. Prove that A can be split into two infinite disjoint regular subsets. b. Let B and D
a. Let A be an infinite regular language. Prove that A can be split into two infinite disjoint regular subsets.
b. Let B and D be two languages. Write B ⋐ D if B ⊆ D and D contains infinitely many strings that are not in B. Show that if B and D are two regular languages where B b D, then we can find a regular language C where B ⋐ C ⋐ D.
Step by Step Solution
3.33 Rating (162 Votes )
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
