Automaticity of double sequences generated by one-dimensional linear cellular automata
From MaRDI portal
Publication:1389657
DOI10.1016/S0304-3975(96)00298-8zbMATH Open0943.11020MaRDI QIDQ1389657FDOQ1389657
Authors: D. Massart 
Publication date: 30 June 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Dynamical aspects of cellular automata (37B15) Cellular automata (computational aspects) (68Q80) Automata sequences (11B85)
Cites Work
- Title not available (Why is that?)
- Endomorphisms and automorphisms of the shift dynamical system
- The ring of \(k\)-regular sequences
- Semigroups, Presburger formulas, and languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Suites algébriques, automates et substitutions
- Uniform tag sequences
- Finite automata in number theory
- Logic and \(p\)-recognizable sets of integers
- On the base-dependence of sets of numbers recognizable by finite automata
- Folds! III: More morphisms
- Title not available (Why is that?)
- Linear cellular automata, finite automata and Pascal's triangle
- AUTOMATIC MAPS ON A SEMIRING WITH DIGITS
- Cellular automata, matrix substitutions and fractals
- Fractal patterns in Gaussian and Stirling number tables
- Title not available (Why is that?)
Cited In (17)
- SELF-SIMILAR STRUCTURE OF RESCALED EVOLUTION SETS OF CELLULAR AUTOMATA II
- Linearization of automatic arrays and weave specifications
- A characterization of \(p\)-automatic sequences as columns of linear cellular automata
- How to prove that a sequence is not automatic
- On subword decomposition and balanced polynomials
- The density of 0's in recurrence double sequences.
- From combinatorial games to shape-symmetric morphisms
- Rational digit systems over finite fields and Christol's theorem
- An analogue of Cobham’s theorem for fractals
- Limit sets of automatic sequences.
- Random matrix products and applications to cellular automata
- Automaticity and invariant measures of linear cellular automata
- The distribution of elements in automatic double sequences
- Automatic maps in exotic numeration systems
- Periodic character sequences where identifying two characters strictly reduces the period
- Construction of some nonautomatic sequences by cellular automata
- Linear recurrent double sequences with constant border in \(M_2(\mathbb F_2)\) are classified according to their geometric content
This page was built for publication: Automaticity of double sequences generated by one-dimensional linear cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1389657)
