An algorithmic approach to tilings of hyperbolic spaces: 10 years later

Authors:
Maurice Margenstern
Affiliations:
Université Paul Verlaine - Metz and CNRS, LORIA, METZ Cédex 1, France
Venue:
CMC'10 Proceedings of the 11th international conference on Membrane computing
Year:
2010

Citing 13
Cited 2

Reversibility and surjectivity problems of cellular automata

Journal of Computer and System Sciences
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
Tools for devising cellular automata in the hyperbolic 3D space

Fundamenta Informaticae - Special issue on cellular automata
VirHKey: a VIRtual Hyperbolic KEYboard with gesture interaction and visual feedback for mobile devices

Proceedings of the 7th international conference on Human computer interaction with mobile devices & services
Palette hyperbolique: un outil pour interagir avec des ensembles de donneacute;es

IHM 2004 Proceedings of the 16th conference on Association Francophone d'Interaction Homme-Machine
A Proposal for a Japanese Keyboard on Cellular Phones

ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
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)
The Injectivity of the Global Function of a Cellular Automaton in the Hyperbolic Plane is Undecidable

Fundamenta Informaticae
The Periodic Domino Problem Is Undecidable in the Hyperbolic Plane

RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
About the Garden of Eden Theorems for Cellular Automata in the Hyperbolic Plane

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

Theoretical Computer Science

Generalized gandy-păun-rozenberg machines for tile systems and cellular automata

CMC'11 Proceedings of the 12th international conference on Membrane Computing
Universality and the halting problem for cellular automata in hyperbolic spaces: the side of the halting problem

UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we give an account of the algorithmic approach developed by the author to study tilings of hyperbolic spaces. We sketchily remember the results which were obtained by this approach and we conclude by possible applications, indicating a few ones already performed and proposing three others.