Teaching Haryana (HPSC) Assistant Professor Mock Test 2025 Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Undecidability
Which one of the following problems is undecidable?
1
Equivalence problem for FSAs
2
Ambiguity problem for CFGs
3
Finiteness problem for FSAs
4
Memberships problem for CFGs
5
Question Not Attempted