We give a complete answer to the question whether a double sequence that is generated by a one-dimensional linear cellular automaton, and whose states are integers modulo m, is k-automatic or not.
Linear cellular automata and automatic sequences
β Scribed by J.-P. Allouche; F.V. Haeseler; E. Lange; A. Petersen; G. Skordev
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 971 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
This work shows that a class of pseudorandom binary sequences, the so-called interleaved sequences, can be generated by means of linear multiplicative polynomial cellular automata. In fact, these linear automata generate all the solutions of a type of linear difference equations with binary coeffici
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 nonsur