The theory of abstract machines defined by rules and a finite (or infinite) set of states — the formal account of computation and control.
Young is openly doubtful, judging finite-automata theory to have “little relevance” to cybernetics as Wiener defined it and to have led to few concrete results.
George makes automata theory a cornerstone, distinguishing finite from infinite (Turing) automata and stressing that an effective theory can be physically built.