M

Mr. Dubey • 52.33K Points
Coach 

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.

Share

Discusssion

Login to discuss.

Loading Comments....

Related MCQs

Q. Array is an example of _______ type memory allocation.

Q. There is no need to establish and terminate a connection through open and close operation in ___________

Q. In a database system there is:

Q. WPA2 is used for security in

Q. _______________________requires Linear Space but uses backtracking

Q. Using _____________ we can systematically visit each node of the tree that could possibly lead to a least-cost solution.

Q. The usual implementation of the carry circuit involves

Q. Orders are processed in the sequence they arrive if rule sequences the jobs.

Q. We have been given a dataset with n records in which we have input attribute as x and output attribute as y. Suppose we use a linear regression method

Q. The programs which are as permanent as hardware and stored in ROM is known as

Question analytics