Linear cellular automata, finite automata and Pascal's triangle
From MaRDI portal
Publication:1917296
DOI10.1016/0166-218X(94)00132-WzbMath0854.68065MaRDI QIDQ1917296
Fritz von Haeseler, Heinz-Otto Peitgen, Gencho Skordev, Jean-Paul Allouche
Publication date: 13 January 1997
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items
Limit sets of automatic sequences. ⋮ The Pascal matroid as a home for generating sets of cellular automata configurations defined by quasigroups ⋮ On the joint subword complexity of automatic sequences ⋮ Global analysis of self-similarity features of cellular automata: selected examples ⋮ Automaticity of double sequences generated by one-dimensional linear cellular automata ⋮ On digital sequences associated with Pascal's triangle ⋮ Automaticity and Invariant Measures of Linear Cellular Automata ⋮ RECURRENT TWO-DIMENSIONAL SEQUENCES GENERATED BY HOMOMORPHISMS OF FINITE ABELIAN p-GROUPS WITH PERIODIC INITIAL CONDITIONS ⋮ From Combinatorial Games to Shape-Symmetric Morphisms ⋮ Syntactical and automatic properties of sets of polynomials over finite fields ⋮ Automatic maps in exotic numeration systems ⋮ An analogue of Cobham’s theorem for fractals ⋮ RESCALED EVOLUTION SETS OF LINEAR CELLULAR AUTOMATA ON A CYLINDER ⋮ SYMMETRIC SELF-ORGANIZATION IN A CELLULAR AUTOMATON REQUIRING AN ESSENTIALLY RANDOM FEEDBACK: OBSERVATIONS, CONJECTURES, QUESTIONS ⋮ AUTOMATICITY OF COARSE-GRAINING INVARIANT ORBITS OF ONE-DIMENSIONAL LINEAR CELLULAR AUTOMATA ⋮ SELF-SIMILAR STRUCTURE OF RESCALED EVOLUTION SETS OF CELLULAR AUTOMATA II ⋮ On the fractal structure of the rescaled evolution set of Carlitz sequences of polynomials ⋮ Frontier between decidability and undecidability: A survey ⋮ Symmetric patterns in the cellular automaton that generates Pascal's triangle modulo 2 ⋮ The monadic theory of morphic infinite words and generalizations
Cites Work
- Additive cellular automata and algebraic series
- Cellular automata can generate fractals
- Algebraic power series and diagonals
- Finite automata in number theory
- Calculating growth rates and moments for additive cellular automata
- Self-similarity of linear cellular automata
- The ring of \(k\)-regular sequences
- Cellular automata, matrix substitutions and fractals
- Algebraic functions over finite fields
- Suites algébriques, automates et substitutions
- SELF-SIMILAR STRUCTURE OF RESCALED EVOLUTION SETS OF CELLULAR AUTOMATA I
- On the base-dependence of sets of numbers recognizable by finite automata
- Uniform tag sequences
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
