2000 character limit reached
A new universal cellular automaton on the ternary heptagrid (0903.2108v1)
Published 12 Mar 2009 in cs.FL and cs.CG
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.