Question: Question 1. Given regular languages L and L2, we know that L(M) U L(M2) is regular also. The proof in class used the fact that

 Question 1. Given regular languages L and L2, we know that

Question 1. Given regular languages L and L2, we know that L(M) U 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 Mi and M2 a construction for a DFA that recognizes LIMi) U LM. 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 Li and L2, L(M) U 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!