On sets of indefinitely desubstitutable words
From MaRDI portal
Publication:2220783
DOI10.1016/j.tcs.2021.01.004zbMath1477.68256arXiv2011.07838OpenAlexW3120280860MaRDI QIDQ2220783
Publication date: 25 January 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.07838
Related Items (1)
Cites Work
- Special factors and the combinatorics of suffix and factor automata
- Some improvements of the \(S\)-adic conjecture
- Substitutions in dynamics, arithmetics and combinatorics
- Quasiperiodic Sturmian words and morphisms
- The stable set of a self-map
- Episturmian words and episturmian morphisms
- Lyndon morphisms
- Random product of substitutions with the same incidence matrix
- Initial powers of Sturmian sequences
- Directive words of episturmian words: equivalences and normalization
- Rank and symbolic complexity
- An $S$-adic characterization of minimal subshifts with first difference of complexity $1 \leq p(n+1) - p(n) \leq 2$
- Beyond substitutive dynamical systems: S-adic expansions
- Characterization of Infinite LSP Words and Endomorphisms Preserving the LSP Property
- Episturmian words and some constructions of de Luca and Rauzy
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On sets of indefinitely desubstitutable words
