Just as finite-state automata corresponded to regular languages, the
context-free languages (CFLs) have corresponding machines called push-down
automata (PDA). In this section we formally define PDAs and examine
the connection with CFLs.
We have previously seen how to construct a deterministic FSA for a regular language; it is an important result of this section that:
