Palindromes in infinite ternary words
From MaRDI portal
Publication:3653092
DOI10.1051/ita/2009016zbMath1191.68476arXiv0901.4261OpenAlexW2115975443MaRDI QIDQ3653092
Štěpán Starosta, Edita Pelantová, L'ubomíra Balková
Publication date: 18 December 2009
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0901.4261
Related Items (3)
On Morphisms Preserving Palindromic Richness ⋮ Sturmian jungle (or garden?) on multiliteral alphabets ⋮ Morphic images of episturmian words having finite palindromic defect
Cites Work
- Sequences with constant number of return words
- Complexity and special factors
- Sequences with subword complexity \(2n\)
- Episturmian words and episturmian morphisms
- Palindromes and Sturmian words
- Factor versus palindromic complexity of uniformly recurrent infinite words
- A connection between palindromic and factor complexity using return words
- Représentation géométrique de suites de complexité $2n+1$
- Symbolic Dynamics II. Sturmian Trajectories
- A characterization of Sturmian words by return words
This page was built for publication: Palindromes in infinite ternary words
