2010/12/03 by Laurent Boyer, Boyer, Laurent, Martin Delacourt +3
Computer Science · Physics and Astronomy · #Cellular Automata and Lattice Gases (nlin.CG) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Physical sciences #Formal Languages and Automata Theory (cs.FL) #cs.DM #cs.FL #nlin.CG
paper · pdf · doi:10.48550/arxiv.1012.1333
Journées Automates Cellulaires 2010, Turku : Finland (2010)
arxiv created 2010/12/03 · arxiv updated 2010/12/08
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.