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:D
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