Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Undecidability
The set A = { 0n 1n 2n | n = 1, 2, 3, ......... } is an example of a grammar that is:
1
Context sensitive
2
Context free
3
Regular
4
None of the above