Pages that link to "Item:Q1389657"
From MaRDI portal
The following pages link to Automaticity of double sequences generated by one-dimensional linear cellular automata (Q1389657):
Displaying 13 items.
- Rational digit systems over finite fields and Christol's theorem (Q331134) (← links)
- A characterization of \(p\)-automatic sequences as columns of linear cellular automata (Q477771) (← links)
- Automatic maps in exotic numeration systems (Q679441) (← links)
- On subword decomposition and balanced polynomials (Q868909) (← links)
- The density of 0's in recurrence double sequences. (Q1415370) (← links)
- Limit sets of automatic sequences. (Q1874466) (← links)
- How to prove that a sequence is not automatic (Q2121041) (← links)
- Random matrix products and applications to cellular automata (Q2479617) (← links)
- The distribution of elements in automatic double sequences (Q2566146) (← links)
- An analogue of Cobham’s theorem for fractals (Q3020345) (← links)
- Automaticity and Invariant Measures of Linear Cellular Automata (Q5138775) (← links)
- From Combinatorial Games to Shape-Symmetric Morphisms (Q5141334) (← links)
- SELF-SIMILAR STRUCTURE OF RESCALED EVOLUTION SETS OF CELLULAR AUTOMATA II (Q5474186) (← links)
