Pushdown automata are a type of formal machine used to recognize context-free languages. This topic covers the properties of pushdown automata, their relationship to context-free grammars, and how they can be used to recognize context-free languages.