A **mobile automaton** (often abbreviated as "MA") is a theoretical computational model used primarily in the study of automata theory and cellular automata. Unlike traditional automata, such as finite state machines or pushdown automata, a mobile automaton consists of a collection of independent agents (or "particles") that can move across a discrete space (often represented as a grid or lattice).
New to topics? Read the docs here!