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

DOI10.1007/978-3-319-39300-1_15zbMath1405.37018arXiv1603.07271OpenAlexW2307359225MaRDI QIDQ3186485

Simon Wacker

Publication date: 10 August 2016

Published in: Cellular Automata and Discrete Complex Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.07271

zbMATH Keywords

cellular automatagroup actionsCurtis-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)

Related Items (3)

The Garden of Eden Theorem for Cellular Automata on Group Sets ⋮ On the image set and reversibility of shift morphisms over discrete alphabets ⋮ Right amenable left group sets and the Tarski-FØlner theorem

Cites Work

• Cellular Automata and Groups
• 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