A new universal cellular automaton on the ternary heptagrid
Formal Languages and Automata Theory
2009-03-13 v1 Computational Geometry
Abstract
In this paper, we construct a new weakly universal cellular automaton on the ternary heptagrid. The previous result, obtained by the same author and Y. Song required six states only. This time, the number of states is four. This is the best result up to date for cellular automata in the hyperbolic plane.
Cite
@article{arxiv.0903.2108,
title = {A new universal cellular automaton on the ternary heptagrid},
author = {Maurice Margenstern},
journal= {arXiv preprint arXiv:0903.2108},
year = {2009}
}
Comments
35 pages, 33 figures