Inequalities characterizing standard Sturmian and episturmian words
From MaRDI portal
Publication:2566013
DOI10.1016/j.tcs.2005.04.008zbMath1077.68085MaRDI QIDQ2566013
Publication date: 22 September 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.04.008
68R15: Combinatorics on words
Related Items
Характеризация чисел Фибоначчи, Episturmian words: a survey, On Sturmian and episturmian words, and related topics, On infinite prefix normal words, Minimal unique expansions with digits in ternary alphabets, Compressed string-matching in standard Sturmian words, Extremal words in morphic subshifts, Characterizations of finite and infinite episturmian words via lexicographic orderings, A characterization of fine words over a finite alphabet, Sturmian and Episturmian Words
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Certain words on the real projective line
- A proof of Shirshov's theorem
- Sturmian words: structure, combinatorics, and their arithmetics
- Episturmian words and episturmian morphisms
- Palindromes and Sturmian words
- Unending chess, symbolic dynamics and a problem in semi-groups
- Sturmian sequences and the lexicographic world
- EPISTURMIAN WORDS: SHIFTS, MORPHISMS AND NUMERATION SYSTEMS
- Repetitions in the Fibonacci infinite word
- Decimations and sturmian words
- On a characteristic property of ARNOUX–RAUZY sequences
- Episturmian words and some constructions of de Luca and Rauzy