Construction of $\mu$-Limit Sets
Discrete Mathematics
2010-12-08 v1 Formal Languages and Automata Theory
Cellular Automata and Lattice Gases
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.
Keywords
Cite
@article{arxiv.1012.1333,
title = {Construction of $\mu$-Limit Sets},
author = {Laurent Boyer and Martin Delacourt and Mathieu Sablik},
journal= {arXiv preprint arXiv:1012.1333},
year = {2010}
}
Comments
Journ\'ees Automates Cellulaires 2010, Turku : Finland (2010)