MadeEasy Test Series: Theory Of Computation - Pushdown Automata

Question

Every cfg may not have equivalent pda

T/F

Comments

whats the question ??????

---

So sorry eveyone

---

false

Answer 1

For every CFG there is an equivalent PDA.

For any CFG  there exists a PDA. L(M)=L(G).

 For any PDA there exists a CFG L(G) = L(M).

Comments

yeah !

---

@DEXTER is there anything wrong

---

arey No No i just have a habit f using excalmation and smiley . dont mind :) You are correct (Y)

Answer 2

yes every cfg will have its equivalent pda. its true.

Answer 3

The statement is false, as either the CFG may be deterministic that will have non deterministic PDA or deterministic PDA  else the grammar can be non deterministic that will have non deterministic PDA. Hence for every CFG there is equivalent PDA