A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. 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?
a. Df ⊂ Nf and Dp ⊂ Np
b. Df ⊂ Nf and Dp = Np
c. Df = Nf and Dp = Np
d. Df = Nf and Dp ⊂ Np
Answer:Df = Nf and Dp ⊂ Np
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: