Asymptotic Randomization of Sofic Shifts by Linear Cellular Automata

Details Asymptotic Randomization of Sofic Shifts by Linear Cellular Automata Asymptotic Randomization of Sofic Shifts by Linear Cellular Automata

2003-06-08

arxiv.org/abs/math/0306136v2

Mathematics

Dynamical Systems

24 pages, 3 figures

Scientific paper

Let M=Z^D be a D-dimensional lattice, and let A be an abelian group. A^M is then a compact abelian group; a `linear cellular automaton' (LCA) is a topological group endomorphism \Phi:A^M --> A^M that commutes with all shift maps. Suppose \mu is a probability measure on A^M whose support is a subshift of finite type or sofic shift. We provide sufficient conditions (on \Phi and \mu) under which \Phi `asymptotically randomizes' \mu, meaning that wk*lim_{J\ni j --> oo} \Phi^j \mu = \eta, where \eta is the Haar measure on A^M, and J has Cesaro density 1. In the case when \Phi=1+\sigma, we provide a condition on \mu that is both necessary and sufficient. We then use this to construct an example of a zero-entropy measure which is asymptotically randomized by 1+\sigma (all previously known examples had positive entropy).

Affiliated with

Also associated with

No associations

Rating

Asymptotic Randomization of Sofic Shifts by Linear Cellular Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Asymptotic Randomization of Sofic Shifts by Linear Cellular Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymptotic Randomization of Sofic Shifts by Linear Cellular Automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-209775