Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Undecidability
Which of the following problems is undecidable ?
1
To determine if two finite automata are equivalent
2
Membership problem for context free grammar
3
Finiteness problem for finite automata
4
Ambiguity problem for context free grammar