Q. Which of the following problems is undecidable? (Solved)
1. Membership problem for CFGs
2. Ambiguity problem for CFGs
3. Finiteness problem for Finite state automata FSAs
4. Equivalence problem for FSAs
- b. Ambiguity problem for CFGs
1. Membership problem for CFGs
2. Ambiguity problem for CFGs
3. Finiteness problem for Finite state automata FSAs
4. Equivalence problem for FSAs