论文信息 - About the embedding of one dimensional cellular automata into hyperbolic cellular automata

About the embedding of one dimensional cellular automata into hyperbolic cellular automata

In this paper, we look at two ways to implement determinisitic one dimensional cellular automata into hyperbolic cellular automata in three contexts: the pentagrid, the heptagrid and the dodecagrid, these tilings being classically denoted by $\{5,4\}$, $\{7,3\}$ and $\{5,3,4\}$ respectively.

Maurice Margenstern

[1] Maurice Margenstern,et al. Surprising Areas in the Quest for Small Universal Devices , 2006, MFCSIT.

[2] Matthew Cook,et al. Universality in Elementary Cellular Automata , 2004, Complex Syst..

[3] Maurice Margenstern,et al. Tools for devising cellular automata in the hyperbolic 3D space , 2003, Fundam. Informaticae.

[4] Maurice Margenstern,et al. A universal cellular automaton on the heptagrid of the hyperbolic plane with four states , 2011, Theor. Comput. Sci..

[5] Yu Song,et al. A New Universal Cellular Automaton on the Pentagrid , 2009, Parallel Process. Lett..

[6] Maurice Margenstern. A weakly universal cellular automaton in the hyperbolic 3D space with three states , 2010, Automata.

[7] Mats G. Nordahl,et al. Universal Computation in Simple One-Dimensional Cellular Automata , 1990, Complex Syst..

[8] Stephen Wolfram,et al. A New Kind of Science , 2003, Artificial Life.

[9] Maurice Margenstern. A new universal cellular automaton on the ternary heptagrid , 2009, ArXiv.

[10] Maurice Margenstern. Cellular Automata in Hyperbolic Spaces , 2009, Encyclopedia of Complexity and Systems Science.