Question 4: [10 marks] L= (0 1 1 n,m EN] Prove this language is non-regular via pumping lemma. Show all steps to gain cr

[answerhappygod]

Question 4 10 Marks L 0 1 1 N M En Prove This Language Is Non Regular Via Pumping Lemma Show All Steps To Gain Cr 1 (17.73 KiB) Viewed 38 times

Question 4: [10 marks] L= (0 1 1 n,m EN] Prove this language is non-regular via pumping lemma. Show all steps to gain credit. Question 5: [10 marks] Design a DPDA against the given abstract machine. Do we need PDA's potential of stack here? Given I = (@,?,%), L = (x | x € *, where x has at least three @'s) Hint: DFA Question 6: [10 marks] Construct a CFG for the given language. (w" xm ym/2 2 | n,m>0 and m is even}