Self-regulating grid-based computational model.

Computational model with limited memory.

Finite machine with predictable behavior.

Automaton with stack for memory.

A tree automaton is a type of state machine.

Stochastic state transitions, computational model.

Smallest automaton for a language.

Mobile automaton (plural: mobile automata) within theoretical computer science, is a class of automata similar to cellular automata but which have a single "active" cell instead of updating all cells in parallel.

In computer science, a suffix automaton is an efficient data structure for representing the substring index of a given string which allows the storage, processing, and retrieval of compressed information about all its substrings.