A characterization of \(p\)-automatic sequences as columns of linear cellular automata
From MaRDI portal
Publication:477771
DOI10.1016/j.aam.2014.10.002zbMath1326.37008arXiv1209.6008MaRDI QIDQ477771
Publication date: 9 December 2014
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1209.6008
finite field; substitution dynamical system; memory; automatic sequence; Christol's theorem; factor map; linear cellular automata
68Q80: Cellular automata (computational aspects)
37B15: Dynamical aspects of cellular automata
37B10: Symbolic dynamics
11B85: Automata sequences
Related Items
Automaticity and Invariant Measures of Linear Cellular Automata, From Combinatorial Games to Shape-Symmetric Morphisms, Characteristic Sequences of the Sets of Sums of Squares as Columns of Cellular Automata, Automatic congruences for diagonals of rational functions, Construction of some nonautomatic sequences by cellular automata, Column representation of Sturmian words in cellular automata, A two-valued recurrent double sequence that is not automatic
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Additive cellular automata and algebraic series
- Substitutions in dynamics, arithmetics and combinatorics
- Substitution dynamical systems. Spectral analysis
- Algebraic properties of cellular automata
- Automaticity of double sequences generated by one-dimensional linear cellular automata
- Algebraic functions over finite fields
- Embedding Bratteli–Vershik systems in cellular automata
- Suites algébriques, automates et substitutions
- Automatic Sequences
- Endomorphisms and automorphisms of the shift dynamical system
- Uniform tag sequences