Which of the following are decidable? 1) Whether the intersection of two regular language is infinite. 2) Whether a given context free language is regular. 3) Whether two push down automata accept the same language. 4) Whether a given grammar is context free.

M

Mr. Dubey • 89.33K Points
Coach

Q. Which of the following are decidable?
1) Whether the intersection of two regular language is infinite.
2) Whether a given context free language is regular.
3) Whether two push down automata accept the same language.
4) Whether a given grammar is context free.

(A) 1 and 2

(B) 1 and 4

(C) 2 and 3

(D) 2 and 4

Correct Answer - Option(B)
Views: 926
Filed under category Theory of Computation

Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. QFD stands for

Q. If the value in protocol field is 17, the transport layer protocol used is

Q. It is a property of the system that equates to its trustworthiness. It is the degree of user’s confidence that the system will operate as one ex

Q. Quick sort follows Divide-and-Conquer strategy.

Q. One of the fields on a form contains a text box which accepts alpha numeric values. Identify the Valid Equivalence class

Q. Port number used by Network Time Protocol (NTP) with UDP is ________

Q. further enhances this data capture ability and makes it real time.

Q. Build & Fix Model is suitable for programming exercises of ___________ LOC (Line of Code).

Q. Derivation of Principles of Management is a matter of (i)………………… and their application is a matter of

Q. The strategy of making processes that are logically runnable to be temporarily suspended is called

Question analytics