A regular grammar for the language L = {anbm | n is even and m is even} is given by
A. S→aSb | S1; S1 → bS1a | λ
B. S→aaS | S1; S1 → bSb | λ
C. S→aSb | S1; S1 → S1ab | λ
D. S→aaS | S1; S1 → bbS1 | λ
Answer:D
A regular grammar for the language L = {anbm | n is even and m is even} is given by
A. S→aSb | S1; S1 → bS1a | λ B. S→aaS | S1; S1 → bSb | λ C. S→aSb | S1; S1 → S1ab | λ D. S→aaS | S1; S1 → bbS1 | λ