(Solved) : Given Regular Languages L1 L2 Know L M1 L M2 Regular Also Proof Class Used Fact Every Regu Q31575609 . . .
Given regular languages L1 and L2, we know that L(M1) ∪ L(M2) isregular also. The proof in class used the fact that every regularlanguage is recognized by a DFA and gave, for any two DFAs M1 andM2 a construction for a DFA that recognizes L(M1) ∪ L(M2). Yourtask is, using the fact that every regular language is recognizedby an NFA, to come up with a alternate proof for “Given regularlanguages L1 and L2, L(M1) ∪ L(M2) is regular also.” You are notpermitted the use of DFAs in your argument.
Expert Answer
Answer to Given Regular Languages L1 L2 Know L M1 L M2 Regular Also Proof Class Used Fact Every Regu Q31575609 . . .
OR