Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.17K Points
Coach 

Q.) Recursive languages are

(A) A proper superset of CFL
(B) Always recognized by PDA
(C) Are also called type 0 languages
(D) Always recognized by FSA
Correct answer : Option (A) - A proper superset of CFL

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs on Theory of Computation

Q. _____________________ ensures that information and resources are available to those who need them.

Q. How many AND gates are required to realize Y = CD+EF+G

Q. Similar communication pattern to all-to-all broadcast except in the_____

Q. The routine ________________ combines data from all processes by adding them in this case and returning the result to a single process.

Q. A lexical analyzer uses the following patterns to recognize three tokens T1, T2, and T3 over the alphabet {a,b,c}. T1: a?(b∣c)*a T2: b?(a∣c)*b T3: c?(b∣a)*c Note that ‘x?’ means 0 or 1 occurrence of the symbol x. Note also that the analyzer outputs the token that matches the longest possible prefix. If the string bbaacabc is processes by the analyzer, which one of the following is the sequence of tokens it outputs?

Q. The device which starts data transfer is called __________

Q. The partition algorithm uses _______ scans of the databases to discover all frequent sets.

Q. Which of the following includes in the classical theory ?

Q. Consider the languages: GATE[2005]L1 = {wwR w €{0, 1} *1L2 ={w#ww € {O,1}*},where # is a special symbolL3 ={www € {0,1}*}Which one of the following is TRUE?

Q. The n × n matrix is partitioned among n2 processors such that each processor owns a _____ element.