Let $N(f) =$ the class of languages accepted by Non- deterministic Finite Automata,
$N(p) =$ the class of languages accepted by Non- deterministic Push down Automata,
$D(f)=$ the class of languages accepted by Deterministic Finite Automata; and,
$D(p)=$ the class of languages accepted by Deterministic Push down Automata.
Then, which one among these statements is TRUE?
- $D(f)$ subset of $N(f)$ and $D(p)$ subset of $N(p)$
- $D(f)$ subset of $N(f)$ and $D(p) = N(p)$
- $D(f) = N(f)$ and $D(p) = N(p)$
- $D(f) = N(f)$ and $D(p)$ subset of $N(p)$