#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language

Every context free grammar can be transformed into an equvalent non deterministic push down automata.

Answer

TRUE