Computer science: Theory Of computation MCQs
16. Question
Consider the machine M
The language recognized by M is:
Answer
17. Question
Let Nf and Np denote the classes of languages accepted by non-deterministic finite automata and non-deterministic push-down automata, respectively. Let Df and Dp denote the classes of languages accepted by deterministic finite automata and deterministic push-down automata respectively. Which one of the following is TRUE?
Answer
18. Question
Consider the languages:
L1 ={anbncm | n,m >0}
L2={anbmcm | n,m >0}
Which one of the following statements is FALSE?
Answer
19. Question
Let L1 be a recursive language, and let L2 be a recursively enumerable but not a recursive language. Which one of the following is TRUE?
Answer
20. Question
Consider the languages:
L1={WWR |W ϵ {0,1}*}
L2={W#WR |W ϵ {0,1}*}, where #is a special symbol
L3={WW |W ϵ {0,1}*}
Which one of the following is TRUE?
Answer
4 thoughts on “Computer science: Theory Of computation MCQs”