Automaticity of double sequences generated by one-dimensional linear cellular automata

DOI10.1016/S0304-3975(96)00298-8zbMath0943.11020MaRDI QIDQ1389657

D. Massart

Publication date: 30 June 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

\(k\)-automatic sequencelinear one-dimensional cellular automata

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15) Automata sequences (11B85)

Related Items

How to prove that a sequence is not automatic ⋮ Limit sets of automatic sequences. ⋮ Rational digit systems over finite fields and Christol's theorem ⋮ On subword decomposition and balanced polynomials ⋮ The density of 0's in recurrence double sequences. ⋮ Automaticity and Invariant Measures of Linear Cellular Automata ⋮ A characterization of \(p\)-automatic sequences as columns of linear cellular automata ⋮ From Combinatorial Games to Shape-Symmetric Morphisms ⋮ Automatic maps in exotic numeration systems ⋮ An analogue of Cobham’s theorem for fractals ⋮ Random matrix products and applications to cellular automata ⋮ SELF-SIMILAR STRUCTURE OF RESCALED EVOLUTION SETS OF CELLULAR AUTOMATA II ⋮ The distribution of elements in automatic double sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite automata in number theory
• Folds! III: More morphisms
• The ring of \(k\)-regular sequences
• Logic and \(p\)-recognizable sets of integers
• Cellular automata, matrix substitutions and fractals
• Linear cellular automata, finite automata and Pascal's triangle
• Semigroups, Presburger formulas, and languages
• AUTOMATIC MAPS ON A SEMIRING WITH DIGITS
• Suites algébriques, automates et substitutions
• On the base-dependence of sets of numbers recognizable by finite automata
• Endomorphisms and automorphisms of the shift dynamical system
• Uniform tag sequences