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
Membership problem for CFGs.
2
Ambiguity problem for CFGs.
3
Finiteness problem for FSAs.
4
Equivalence problem for FSAs.