Construction of $\mu$-Limit Sets
Laurent Boyer (LAMA), Martin Delacourt (LIF), Mathieu Sablik (LATP)

TL;DR
This paper presents a method to construct cellular automata that realize specific subshifts as their $$-limit sets under the uniform Bernoulli measure, expanding understanding of cellular automaton behaviors.
Contribution
It introduces a construction technique for cellular automata to realize given subshifts as $$-limit sets, for a broad class of subshifts.
Findings
Constructed cellular automata for specific subshifts as $$-limit sets
Demonstrated realization under the uniform Bernoulli measure
Extended the class of subshifts achievable as $$-limit sets
Abstract
The -limit set of a cellular automaton is a subshift whose forbidden patterns are exactly those, whose probabilities tend to zero as time tends to in- finity. In this article, for a given subshift in a large class of subshifts, we propose the construction of a cellular automaton which realizes this subshift as -limit set where is the uniform Bernoulli measure.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCellular Automata and Applications · Mathematical Dynamics and Fractals · semigroups and automata theory
