Properties of a ternary infinite word
DOI10.1051/ita/2022010zbMath1527.11021arXiv2206.01776OpenAlexW4319996143MaRDI QIDQ6041042
Jeffrey O. Shallit, Pascal Ochem, James D. Currie, Narad Rampersad
Publication date: 25 May 2023
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.01776
critical exponentrecurrencelinear representationfinite automatonautomatic sequencefactor complexitysynchronized sequencebalanced wordabelian complexityappearancePisot numeration system
Combinatorics on words (68R15) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Automata sequences (11B85)
Cites Work
- Unnamed Item
- Unnamed Item
- Bertrand numeration systems and recognizability
- A set of sequences of complexity \(2n+1\)
- On cube-free \(\omega\)-words generated by binary morphisms
- Synchronized sequences
- Subword complexity and power avoidance
- Abelian complexity of minimal subshifts
- Decision algorithms for Fibonacci-automatic Words, I: Basic results
- Systems of Numeration
- Repetitions in the Fibonacci infinite word
- Abelian Complexity and Synchronization
- Episturmian words: a survey
- Sequences with minimal block growth
- Symbolic Dynamics II. Sturmian Trajectories
This page was built for publication: Properties of a ternary infinite word
