2000 character limit reached
A weakly universal cellular automaton on the tessellation $\{9,3\}$ (1605.09518v1)
Published 31 May 2016 in cs.DM and nlin.CG
Abstract: In this paper, we construct a weakly universal cellular automaton on the tessellation ${9,3}$ which has two states and which is not rotation invariant but which is truly planar.