Mobile automaton

This article has multiple issues. Please help improve it or discuss these issues on the talk page. Its introduction provides insufficient context for those unfamiliar with the subject. Tagged since October 2009. Very few or no other articles link to it. Please help introduce links to this page from other articles related to it. Tagged since February 2009. It may need to be wikified to meet Wikipedia's quality standards. Tagged since March 2012.

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" from MathWorld.