[Solved]-Q1 Maximum Score 15 Determine Following Language Regular Prove Language Regular One Show Q37207449

Q1 Maximum score 15 Determine if the following language is regular or not. (Not to prove that a language is regular, one has to show that there is a NFA/DFA for it and to show that it is not regular, one has to use pumping lemma) Q. 2 Maximum score 15 What is the language accepted by the following PDA: Σ= {a,b} Stack symbols-, {LU 1 Uz) Starting state Accepting state q Transition rules Q.3 Maximum score 20 Construct a Non-deterministic PDA that accepts the language L(w:n(w)+no(w) n.(w)) over -(ab.e). Give the rules (in the form of a diagram are acceptable) Show transcribed image text Q1 Maximum score 15 Determine if the following language is regular or not. (Not to prove that a language is regular, one has to show that there is a NFA/DFA for it and to show that it is not regular, one has to use pumping lemma) Q. 2 Maximum score 15 What is the language accepted by the following PDA: Σ= {a,b} Stack symbols-, {LU 1 Uz) Starting state Accepting state q Transition rules Q.3 Maximum score 20 Construct a Non-deterministic PDA that accepts the language L(w:n(w)+no(w) n.(w)) over -(ab.e). Give the rules (in the form of a diagram are acceptable)

Expert Answer

---

Answer to Q1 Maximum score 15 Determine if the following language is regular or not. (Not to prove that a language is regular, one… . . .