Topology Inspired Problems for Cellular Automata, and a Counterexample in Topology

zbMath1466.37015arXiv1208.2783MaRDI QIDQ4986304

Ilkka Törmä, Jarkko Peltomäki

Publication date: 27 April 2021

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

zbMATH Keywords

Besicovitch distancetopologizationfixed alphabetset of all cellular automata

Mathematics Subject Classification ID

Dynamical aspects of cellular automata (37B15) Symbolic dynamics (37B10) Dynamics in general topological spaces (37B02)

This page was built for publication: Topology Inspired Problems for Cellular Automata, and a Counterexample in Topology