Teaching TN TRB CS Mock Test Theory of Computation Regular Languages and Finite Automata Regular Languages
Identify the language generated by the following grammar, where S is the start variable.
S → XY
X → aX | a
Y → aYb | ϵ1
{ambn | m ≥ n, n > 0}
2
{ambn | m ≥ n, n ≥ 0}
3
{ambn | m > n, n ≥ 0}
4
{ambn | m > n, n > 0}