Question: Given regular languages L1 and L2, we know that L(M1) L(M2) is regular also. The proof in class used the fact that every regular language

Given regular languages L1 and L2, we know that L(M1) L(M2) is regular also. The proof in class used the fact that every regular language is recognized by a DFA and gave, for any two DFAs M1 and M2 a construction for a DFA that recognizes L(M1) L(M2). Your task is, using the fact that every regular language is recognized by an NFA, to come up with a alternate proof for Given regular languages L1 and L2, L(M1) L(M2) is regular also. You are not permitted the use of DFAs in your argument.

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!