Cellular Automata on Group Sets and the Uniform Curtis-Hedlund-Lyndon Theorem - Inria - Institut national de recherche en sciences et technologies du numérique
Communication Dans Un Congrès Année : 2016

Cellular Automata on Group Sets and the Uniform Curtis-Hedlund-Lyndon Theorem

Résumé

We introduce cellular automata whose cell spaces are left homogeneous spaces and prove a uniform as well as a topological variant of the Curtis-Hedlund-Lyndon theorem. Examples of left homogeneous spaces are spheres, Euclidean spaces, as well as hyperbolic spaces acted on by isometries; vertex-transitive graphs, in particular, Cayley graphs, acted on by automorphisms; groups acting on themselves by multiplication; and integer lattices acted on by translations.
Fichier principal
Vignette du fichier
395687_1_En_15_Chapter.pdf (338.26 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01435028 , version 1 (13-01-2017)

Licence

Identifiants

Citer

Simon Wacker. Cellular Automata on Group Sets and the Uniform Curtis-Hedlund-Lyndon Theorem. 22th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2016, Zurich, Switzerland. pp.185-198, ⟨10.1007/978-3-319-39300-1_15⟩. ⟨hal-01435028⟩
127 Consultations
100 Téléchargements

Altmetric

Partager

More