This document discusses pushdown automata (PDA). It defines a PDA as an ε-NFA with a stack, where transitions accommodate stack operations. Unlike DFAs which can only remember a finite amount of information, PDAs can remember an infinite amount using their stack. The document then formally defines the components of a PDA as a finite set of states Q, input symbols S, stack alphabet G, transition function δ, start state q0, start stack symbol Z0, accepting states F. It notes PDA diagrams graphically represent states as nodes, the start state with an arrow, accepting states as doubly circled, and transitions as edges labeled with input symbols, stack symbols, and replacement strings.