Cellular automata on group sets and the uniform Curtis-Hedlund-Lyndon theorem

DOI10.1007/s11047-017-9645-yzbMath1530.37034OpenAlexW4232542848MaRDI QIDQ6191402

Simon Wacker

Publication date: 9 February 2024

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-017-9645-y

zbMATH Keywords

homogeneous spacescellular automatagroup actionsinvertibilitypropernessCurtis-Hedlund-Lyndon theorem

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cites Work

• Deformation of proper actions on reductive homogeneous spaces
• A generalization of the Curtis-Hedlund theorem
• Introduction to Smooth Manifolds
• Sliding block codes between shift spaces over infinite alphabets
• Cellular Automata and Groups
• The Garden of Eden Theorem for Cellular Automata on Group Sets
• Right amenable left group sets and the Tarski-FØlner theorem
• A note on the definition of sliding block codes and the Curtis-Hedlund-Lyndon Theorem
• Cellular automata on a $G$-set
• One-sided shift spaces over infinite alphabets
• Endomorphisms and automorphisms of the shift dynamical system

This page was built for publication: Cellular automata on group sets and the uniform Curtis-Hedlund-Lyndon theorem