%0 Conference Proceedings
%T Cellular Automata on Group Sets and the Uniform Curtis-Hedlund-Lyndon Theorem
%+ Karlsruhe Institute of Technology (KIT)
%A Wacker, Simon
%Z Part 2: Regular Papers
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 22th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA)
%C Zurich, Switzerland
%Y Matthew Cook
%Y Turlough Neary
%3 Cellular Automata and Discrete Complex Systems
%V LNCS-9664
%P 185-198
%8 2016-06-15
%D 2016
%R 10.1007/978-3-319-39300-1_15
%K Cellular automata
%K Group actions
%K Curtis-Hedlund-Lyndon theorem
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 1
%Z WG 1.5
%2 https://inria.hal.science/hal-01435028/document
%2 https://inria.hal.science/hal-01435028/file/395687_1_En_15_Chapter.pdf
%L hal-01435028
%U https://inria.hal.science/hal-01435028
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-LNCS-9664
%~ IFIP-WG1-5
%~ IFIP-AUTOMATA