An automaton (plural&colon; automata or automatons) is a self-operating machine. The figure illustrates a deterministic finite automaton using a state diagram. A trie can be seen as a tree-shaped deterministic finite automaton. Every context-free grammar can be transformed into an equivalent nondeterministic pushdown automaton. An equivalent minimal deterministic automaton is shown below. This is where it differs from the nondeterministic pushdown automaton. These languages are exactly all languages that can be recognized by a non-deterministic pushdown automaton. Computations of the pushdown automaton are sequences of steps. Alternatively, a regular language can be defined as a language recognized by a finite automaton. Examples of automaton clocks include Chariot clock and Cuckoo Clocks. For every regular language there is a finite state automaton (FSA) that accepts the language. This unit hypercube is the cellular automaton rule space. These languages are exactly all languages that can be decided by a finite state automaton. This contrasts with an ordinary finite-state automaton, which has a single tape. Finding a valid derivation using an automaton.