Cellular automata and combinatoric tilings in hyperbolic spaces: a survey

Authors:
Maurice Margenstern
Affiliations:
Laboratoire d'Informatique Théorique et Appliquée, Université de Metz, I.U.T. de Metz, Département d'Informatique, Metz Cedex, France
Venue:
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Year:
2003

Citing 5
Cited 7

One-way cellular automata on Cayley graphs

Theoretical Computer Science
Foundations of computing

Foundations of computing
NP problems are tractable in the space of cellular automata in the hyperbolic plane

Theoretical Computer Science
A universal cellular automaton in the hyperbolic plane

Theoretical Computer Science
Theory of Self-Reproducing Automata

Theory of Self-Reproducing Automata

On the infinigons of the hyperbolic plane, a combinatorial approach

Fundamenta Informaticae
Register cellular automata in the hyperbolic plane

Fundamenta Informaticae
The domino problem of the hyperbolic plane is undecidable

Theoretical Computer Science
A Universal Cellular Automaton on the Ternary Heptagrid

Electronic Notes in Theoretical Computer Science (ENTCS)
A universal cellular automaton on the heptagrid of the hyperbolic plane with four states

Theoretical Computer Science
Register Cellular Automata in the Hyperbolic Plane

Fundamenta Informaticae
On the Infinigons of the Hyperbolic Plane, A combinatorial approach

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

The first paper on cellular automata in the hyperbolic plane appeared in [37], based on the technical report [35]. Later, several papers appeared in order to explore this new branch of computer science. Although applications are not yet seen, they may appear, especially in physics, in the theory of relativity or for cosmological researches.