DPDAs are a strict subclass of PDAs

This file transfers the class-level strictness theorem DCF ⊊ CF to the corresponding automaton classes.

theorem DPDA_strict_subclass_PDA : DPDA.Class ⊂ PDA.Class

DPDA final-state languages are a strict subclass of PDA languages over a three-symbol alphabet.