Grammar Languages Automaton Production rules (constraints) Type-0 Recursively enumerable Turing machine  (no restrictions) Type-1 Context-sensitive Linear-bounded non-deterministic Turing machine Type-2 Context-free Non-deterministic pushdown autom…