Jump to content

Mobile automaton

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by David Eppstein (talk | contribs) at 20:13, 17 December 2018 ({{comp-sci-theory-stub}}). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Mobile automaton (plural: mobile automata) is a class of automata similar to cellular automata but which have a single "active" cell instead of updating all cells in parallel. In a mobile automaton, the evolution rules apply only to the active cell, and also specify how the active cell moves from one generation to the next. All cells that are not active remain the same from one generation to the next. Mobile automata can therefore be considered a hybrid between elementary cellular automata and Turing machines.

References

  • Weisstein, Eric W. "Mobile Automaton". MathWorld.