An **automaton** (= model of computation = computational model = abstract
machine = abstract computer) is a self-operating machine. Some examples
include Turing machines, finite-state machines, and neural networks.

Automatons are capable of recognize a formal grammar.

*Automata theory* is a branch of the theory of computation that studies
automata.

The word "automation" is the latinization of the Greek αὐτόματον, automaton, (neuter) "acting of one’s own will". This word was first used by Homer to describe automatic door opening,[2] or automatic movement of wheeled tripods.[3] It is more often used to describe non-electronic moving machines, especially those that have been made to resemble human or animal actions, such as the jacks on old public striking clocks, or the cuckoo and any other animated figures on a cuckoo clock.

An automaton consists of:

- A set of allowable operations
- The respective costs of each operation

- Finite-state machine
- Pushdown automaton
- Linear bounded automaton
- Turing machine

The set of all strings that an automata recognizes is called its language.

The value of a computational model is that it can make precise predictions that can be compared with human performance.

[1] | Massaro 1998 |