Construction of \(\mu\)-Limit Sets

The \(\mu\)-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 realize...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2010-12
Main Authors: Boyer, Laurent, Delacourt, Martin, Sablik, Mathieu
Format: Article
Language:English
Subjects:
Cellular automata
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The \(\mu\)-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 \(\mu\)-limit set where \(\mu\) is the uniform Bernoulli measure.
ISSN:2331-8422