Question: Problem 1 8 . Prove that for any infinite regular language L , there exist two infinite regular languages L 1 , L 2 such

Problem 18. Prove that for any infinite regular language L, there exist two infinite regular languages L1,L2 such that L=L1L2 and L1L2=O?. Here are some hints.
Let D be any DFA and q be any one of its states. Prove that the language
Lq={x|xinL(D) and the run ofDonx visits qan odd number of times }
is regular.
2. Recall the proof of the pumping lemma.
 Problem 18. Prove that for any infinite regular language L, there

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!