2000 character limit reached
A weakly universal cellular automaton with 2 states on the tiling {11,3}
Published 26 Jan 2015 in nlin.CG and cs.FL | (1501.06328v1)
Abstract: In this paper, we construct a weakly universal cellular automaton with two states only on the tiling {11,3}. The cellular automaton is rotation invariant and it is a true planar one.
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.