McqMate
Q. |
Which of the following problems is undecidable? |
A. | Membership problem for CFGs |
B. | Ambiguity problem for CFGs. |
C. | Finiteness problem for FSAs. |
D. | Equivalence problem for FSAs. |
Answer» B. Ambiguity problem for CFGs. |
View all MCQs in
Theory of ComputationNo comments yet