engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Regular Languages and Finite Automata Regular Languages
The grammar G = ({S, X, Y}, {p, q}, S, P) with productions
S → X, X → qY | ϵ, Y → Xp is a _____.
1
G is Regular grammar
2
G is right linear grammar
3
G is left linear grammar
4
G is linear grammar