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

For every CFL, G, there exists a PDA M such that L(G) = L(M) and vice versa.

Answer

TRUE