A4 Refereed article in a conference publication
Topology Inspired Problems for Cellular Automata, and a Counterexample in Topology
Authors: Ville Salo, Ilkka Törmä
Editors: Enrico Formenti
Publication year: 2012
Journal: Electronic Proceedings in Theoretical Computer Science
Book title : Proceedings 18th international workshop on Cellular Automata and Discrete Complex Systems and 3rd international symposium Journées Automates Cellulaires
Article number: 5
Series title: Electronic Proceedings in Theoretical Computer Science
Volume: 9
First page : 53
Last page: 68
Number of pages: 16
ISSN: 2075-2180
DOI: https://doi.org/10.4204/EPTCS.90.5(external)
We consider two relatively natural topologizations of the set of all cellular automata on a fixed alphabet. The first turns out to be rather pathological, in that the countable space becomes neither first-countable nor sequential. Also, reversible automata form a closed set, while surjective ones are dense. The second topology, which is induced by a metric, is studied in more detail. Continuity of composition (under certain restrictions) and inversion, as well as closedness of the set of surjective automata, are proved, and some counterexamples are given. We then generalize this space, in the
sense that every shift-invariant measure on the configuration space induces a pseudometric on cellular automata, and study the properties of these spaces. We also characterize the pseudometric spaces using the Besicovitch distance, and show a connection to the first (pathological) space.
Downloadable publication This is an electronic reprint of the original article. |  |
