𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Attractors of Linear Cellular Automata

✍ Scribed by Giovanni Manzini; Luciano Margara


Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
147 KB
Volume
58
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

✦ Synopsis


In this paper we study the asymptotic behavior of D-dimensional linear cellular automata over the ring Z m (D 1, m 2). In the first part of the paper we consider nonsurjective cellular automata (CA). We prove that, after a transient phase of length at most wlog 2 mx, the evolution of a linear nonsurjective cellular automata F takes place completely within a subspace Y F . This result suggests that we can get valuable information on the long term behavior of F by studying its properties when restricted to Y F . We prove that such study is possible by showing that the system (Y F , F ) is topologically conjugated to a linear cellular automata F * defined over a different ring Z m . In the second part of the paper, we study the attractor sets of linear cellular automata. Recently, Kurka has shown that CA can be partitioned into five disjoint classes according to the structure of their attractors. We present a procedure for deciding the membership in Kurka's classes for any linear cellular automata. Our procedure requires only gcd computations involving the coefficients of the local rule associated to the cellular automata.


πŸ“œ SIMILAR VOLUMES


Linear cellular automata over Zm
✍ Masanobu ItΓ΄; Nobuyasu Γ”sato; Masakazu Nasu πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 969 KB
Invertible Linear Cellular Automata over
✍ Giovanni Manzini; Luciano Margara πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 256 KB

We give an explicit and efficiently computable formula for the inverse of D-dimensional linear cellular automata over Z m (D 1, m 2). We use this formula to get an easy-to-check necessary and sufficient condition for an invertible one-dimensional linear CA to be expansive, and we prove that this con

A decision procedure for well-formed lin
✍ Christoph DΓΌrr; Huong LΓͺThanh; Miklos Santha πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 196 KB

In this paper we introduce a new quantum computation model, the linear quantum cellular automaton. Well-formedness is an essential property for any quantum computing device since it enables us to define the probability of a configuration in an observation as the squared magnitude of its amplitude. W