Hopcroft, J. E., Motwani, R., & Ullman, J. D. (2006). Introduction to Automata Theory, Languages, and Computation (3rd ed.). Pearson Education.

• Comprehensive coverage of PDA-CFG equivalence theorem and constructive proofs
• Chapter 6: Properties of Context-Free Languages - detailed equivalence demonstrations

Sipser, M. (2012). Introduction to the Theory of Computation (3rd ed.). Course Technology.

• Clear exposition of pushdown automata and context-free grammars equivalence
• Chapter 2: Context-Free Languages - fundamental concepts and conversion algorithms

Lewis, H. R., & Papadimitriou, C. H. (1997). Elements of the Theory of Computation (2nd ed.). Prentice Hall.

• Mathematical foundations of computational equivalence between PDAs and CFGs
• Chapter 3: Context-Free Languages - rigorous treatment of equivalence proofs