Column representation of Sturmian words in cellular automata
From MaRDI portal
Publication:2163988
DOI10.1007/978-3-031-05578-2_10OpenAlexW4285173938MaRDI QIDQ2163988
Francesco Dolce, Pierre-Adrien Tahay
Publication date: 11 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-05578-2_10
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A characterization of \(p\)-automatic sequences as columns of linear cellular automata
- Turing machine universality of the game of life
- Language complexity of rotations and Sturmian sequences
- Signals in one-dimensional cellular automata
- Well-balanced sequences
- Episturmian words and episturmian morphisms
- Construction of some nonautomatic sequences by cellular automata
- On balanced sequences and their asymptotic critical exponent
- Acyclic, connected and tree sets
- Sturmian jungle (or garden?) on multiliteral alphabets
- Rigidity and Substitutive Dendric Words
- Eventually dendric shift spaces
- Generation of Primes by a One-Dimensional Real-Time Iterative Array
- Endomorphisms and automorphisms of the shift dynamical system
- Sequences with minimal block growth
- Symbolic Dynamics II. Sturmian Trajectories
This page was built for publication: Column representation of Sturmian words in cellular automata
