Question: Question 7: a) Let L 3 = {1 n 0 k 1 4n | n 0, k > 0}. Prove thatd there is no DFA

Question 7:

a) Let L3 = {1n0k14n | n 0, k > 0}. Prove thatd there is no DFA M3 for L3 such that L(M3) = L3

b) Let L4 = {a, b} \ {wawR | w is any string over {a, b}} be a language over = {a, b}. Prove that there is no DFA M4 such that L(M4 ) = L4. Your proof should be short and not use the Pumping Lemma.

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!