Push-Down Automata and Context-Free Grammars
Lecture notes defining context free grammars and closure and decidability properties of context free languages. There is a short section showing that natural languages are not context free.

No queries for people.umass.edu/partee/726_04/lectures/Lecture%2014%20PDAs%20and%20CFGs.pdf#search="pushdown automata"