Let Nf and Np denote the classes of languages accepted by non-deterministic…
GATE · 2005 · CS
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
Attempted by 142 students.
Sign up free to check your answer
Sign up freeLoading lesson…