Question: Problem 1 8 . Prove that for any infinite regular language L , there exist two infinite regular languages L 1 , L 2 such
Problem Prove that for any infinite regular language there exist two infinite regular languages such that and Here are some hints.
Let be any DFA and be any one of its states. Prove that the language
and the run visits odd number times
is regular.
Recall the proof of the pumping lemma.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
