Automaticity of double sequences generated by one-dimensional linear cellular automata
From MaRDI portal
Publication:1389657
DOI10.1016/S0304-3975(96)00298-8zbMath0943.11020MaRDI QIDQ1389657
Publication date: 30 June 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q80: Cellular automata (computational aspects)
37B15: Dynamical aspects of cellular automata
11B85: Automata sequences
Related Items
Automatic maps in exotic numeration systems, The density of 0's in recurrence double sequences., Limit sets of automatic sequences., 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