A4 Vertaisarvioitu artikkeli konferenssijulkaisussa
Symbol Frequencies in Surjective Cellular Automata
Tekijät: Hellouin de Menibus, Benjamin; Salo, Ville; Törmä, Ilkka
Toimittaja: Riva, Sara; Richard, Adrien
Konferenssin vakiintunut nimi: International Workshop on Cellular Automata and Discrete Complex Systems
Kustantaja: Springer Nature Switzerland
Julkaisuvuosi: 2025
Lehti: Lecture Notes in Computer Science
Kokoomateoksen nimi: Cellular Automata and Discrete Complex Systems: 31st IFIP WG 1.5 International Workshop, AUTOMATA 2025, Lille, France, June 30 – July 2, 2025, Proceedings
Vuosikerta: 15831
Aloitussivu: 154
Lopetussivu: 170
ISBN: 978-3-032-01569-3
eISBN: 978-3-032-01570-9
ISSN: 0302-9743
eISSN: 1611-3349
DOI: https://doi.org/10.1007/978-3-032-01570-9_11
Julkaisun avoimuus kirjaamishetkellä: Ei avoimesti saatavilla
Julkaisukanavan avoimuus : Ei avoin julkaisukanava
Verkko-osoite: https://doi.org/10.1007/978-3-032-01570-9_11
We study the behavior of probability measures under iteration of a surjective cellular automaton. We solve the following question in the negative: if the initial measure is ergodic and has full support, do all weak-* limit points of the sequence of measures have full support as well? The initial measure of our solution is not a product measure, and in this case the question remains open. To this end, we present a tool for studying the frequencies of symbols in preimages of surjective cellular automata, and prove some basic results about it. However, we show that by itself it is not enough to solve the stricter question in the positive.
