Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability
The production rules S → Sα1 | Sα2 | β1 | β2 is equivalent to which one of the following production rules?
1
S → α1 S | α2 S | β1 | β2
2
S → β1 A | β2 A, A → α1 A | α2 A | α1 | α2
3
S → β1 A | β2 A, A → α1 A | α2 A | ϵ
4
S → β1 | β2 | β1 A | β2 A, A → α1 A | α2 A