A characterization of fine words over a finite alphabet
From MaRDI portal
Publication:2474224
DOI10.1016/j.tcs.2007.10.029zbMath1133.68065arXiv0708.4406OpenAlexW2158592145MaRDI QIDQ2474224
Publication date: 5 March 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0708.4406
lexicographic orderSturmian wordcombinatorics on wordsArnoux-Rauzy sequenceEpisturmian wordskew word
Related Items (7)
On a generalization of Christoffel words: epichristoffel words ⋮ Classification of eventually periodic subshifts ⋮ Quasiperiodic and Lyndon episturmian words ⋮ Episturmian words: a survey ⋮ Analysis of generating functions for special words and numbers and algorithms for computation ⋮ \(k\)-ary Lyndon words and necklaces arising as rational arguments of Hurwitz-Lerch zeta function and Apostol-Bernoulli polynomials ⋮ Directive words of episturmian words: equivalences and normalization
Cites Work
- Extremal properties of (epi)Sturmian sequences and distribution modulo 1
- Morse and Hedlund's skew Sturmian words revisited
- Sturmian words: structure, combinatorics, and their arithmetics
- Conjugacy and episturmian morphisms.
- Some remarks on invertible substitutions on three letter alphabet.
- Episturmian words and episturmian morphisms
- Powers in a class of \(\mathcal A\)-strict standard episturmian words
- Characterizations of finite and infinite episturmian words via lexicographic orderings
- Inequalities characterizing standard Sturmian and episturmian words
- Return words in Sturmian and episturmian words
- EPISTURMIAN WORDS: SHIFTS, MORPHISMS AND NUMERATION SYSTEMS
- Représentation géométrique de suites de complexité $2n+1$
- On a characteristic property of ARNOUX–RAUZY sequences
- A generalization of Sturmian sequences: Combinatorial structure and transcendence
- Episturmian words and some constructions of de Luca and Rauzy
This page was built for publication: A characterization of fine words over a finite alphabet
