User:Hppavilion1/Comparative automata

This userspace article serves as a hub for comparisons of the various automata studied by Automata theory by providing a set of defintions presented in a consistent format.

Motivation
Between the various automata which have articles on Wikipedia, the definitions given aren't entirely consistent. They're generally presented as n-tuples of various mathematical objects which together define the automaton; however, due to being written by different authors, the definitions are sometimes structurally different—for example, the parameters might be given in a different order or go by different names (Finite-state machine gives the alphabet $$\Sigma$$ first followed by its set of states $$S$$, whereas the theoretically-equivalent Deterministic finite automaton starts with its set of states $$Q$$ followed by its alphabet $$\Sigma$$).

To make all these pages easier to understand, I think it would be best to definite each automaton in a regular "format" (which one doesn't need specific knowledge of to understand) so that someone reading through each of the pages can more easily grasp which differences between the automata are significant.