A new universal cellular automaton on the ternary heptagrid

Simple item page
dc.creatorMargenstern, Maurice
dc.date2009-03-12
dc.date.accessioned2026-07-07T12:51:51Z
dc.date.available2026-07-07T12:51:51Z
dc.descriptionIn 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.
dc.description35 pages, 33 figures
dc.identifierhttps://arxiv.org/abs/0903.2108
dc.identifierhttp://arxiv.org/abs/0903.2108
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/223122
dc.subjectFormal Languages and Automata Theory
dc.subjectComputational Geometry
dc.subjectF.2.2
dc.titleA new universal cellular automaton on the ternary heptagrid
dc.typetext

Files

Collections

arXiv