2000 character limit reached
A new universal cellular automaton on the ternary heptagrid
Published 12 Mar 2009 in cs.FL and cs.CG | (0903.2108v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.