Consider the below mentioned PDA M1 (Q, ∑, Г, δ, q0, Z, F) which accepts thelanguage L.
Where:
Q={q0, q1, q2, q3, q4}
Σ={a,b}
Г={a,b,Z}
Z=initial pushdown symbol
F=set of final states, empty in this case as the string is accepted by null store.
Choose the correct Grammar for the language L accepted by M1 from the following options.
1.
S → aaBb|aab, B → aaBb|aab
2.
None of the above.
3.
S →aaBb|∊, B →aaBb|aab
4.
S →aaBb|aab|∊, B →aaBb|aab
