Solved

Which of the Following Problems Is Undecidable

Question 26

Multiple Choice

Which of the following problems is undecidable?

A) Membership problem for CFGs
B) Ambiguity problem for CFGs
C) Finiteness problem for Finite state automata FSAs
D) Equivalence problem for FSAs

Related Questions

Q21: Which of the following is not a

Q22: A Hamiltonian cycle in a Hamiltonian graph

Q23: The language accepted by a Push down

Q24: If G is "S ? a S/a",

Q25: The …………. is said to be ambiguous

Q27: The regular expression 0*(10)* denotes the same

Q28: Which of the following strings is not

Q29: Let P be a regular language and

Q30: Consider the NFA M shown below.<br><img src="https://d2lvgg3v3hfg70.cloudfront.net/MM963/.jpg"

Q31: Which one of the following statement is