Ace Test Series

Question

Can any one explain I am not able to understand.

Comments

here A) will be ans

---

Mam here I know that DPDA and NDPA dont have same power so Sentence iv) is wrong but why is iii) wrong

---

I think option 'D' is the correct one.

Everything is true.

'iii' is true because Regular languages are a subset of CFL.

'iv' is true because DPDAs are a subset of NPDAs

Answer 1

1. Every DFA by it's definition is also an NFA, and €-NFA-True

2. DFA and NFA are equivalent so every NFA has an equivalent minimal DFA- True

3. DFA when provided with a stack becomes a DPDA, so for every DFA we can have an equivalent DPDA with no push or pop being performed in stack- True

4. Every DPDA can be converted to equivalent NPDA but vice versa is not true hence both are not equivalent. A language is accepted by a DPDA means there is a defined unique transition for every input, and NPDA asks for atleast 1 transition to final state, so DPDA's are subsets of NPDA's.

Hence all are correct- D