Sturmian and Episturmian Words
From MaRDI portal
Publication:3522857
DOI10.1007/978-3-540-75414-5_2zbMath1149.68065OpenAlexW4327762771MaRDI QIDQ3522857
Publication date: 4 September 2008
Published in: Algebraic Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-75414-5_2
Related Items (48)
The sequence of open and closed prefixes of a Sturmian word ⋮ Abelian powers and repetitions in Sturmian words ⋮ On a generalization of Christoffel words: epichristoffel words ⋮ Classification of eventually periodic subshifts ⋮ Asymptotic behavior of non-expanding piecewise linear maps in the presence of random noise ⋮ Quasiperiodic and Lyndon episturmian words ⋮ Abelian Repetitions in Sturmian Words ⋮ Cyclic Complexity of Words ⋮ Arnoux-Rauzy interval exchanges ⋮ Fixed points of Sturmian morphisms and their derivated words ⋮ Counting Lyndon factors ⋮ Lost in Self-Stabilization ⋮ Geometry, dynamics, and arithmetic of $S$-adic shifts ⋮ Open and closed factors in Arnoux-Rauzy words ⋮ Derived sequences of complementary symmetric Rote sequences ⋮ Sturmian graphs and integer representations over numeration systems ⋮ Order Conditions for Languages ⋮ Clustering and Arnoux-Rauzy words ⋮ On theta-palindromic richness ⋮ Some properties of the \(k\)-bonacci words on infinite alphabet ⋮ A standard correspondence on epicentral words ⋮ On generating binary words palindromically ⋮ On $k$-abelian equivalence and generalized Lagrange spectra ⋮ Continued fractions with $SL(2, Z)$-branches: combinatorics and entropy ⋮ Computing the number of cubic runs in standard Sturmian words ⋮ Morphic images of episturmian words having finite palindromic defect ⋮ Cyclic complexity of words ⋮ Involutions of epicentral words ⋮ Special factors and the combinatorics of suffix and factor automata ⋮ On the number of episturmian palindromes ⋮ Infinite labeled trees: from rational to Sturmian trees ⋮ Characteristic Sturmian words are extremal for the critical factorization theorem ⋮ Balance and abelian complexity of the Tribonacci word ⋮ Standard factors of Sturmian words ⋮ On z-factorization and c-factorization of standard episturmian words ⋮ A characterization of Sturmian sequences by indistinguishable asymptotic pairs ⋮ A palindromization map on free monoids ⋮ Palindromic richness ⋮ On a Family of Morphic Images of Arnoux-Rauzy Words ⋮ On Lazy Representations and Sturmian Graphs ⋮ Directive words of episturmian words: equivalences and normalization ⋮ Repetitions in beta-integers ⋮ Rich and Periodic-Like Words ⋮ SOME EXTREMAL PROPERTIES OF THE FIBONACCI WORD ⋮ On graphs of central episturmian words ⋮ Sturmian words and the Stern sequence ⋮ Studies on finite Sturmian words ⋮ A \(d\)-dimensional extension of Christoffel words
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- *-Sturmian words and complexity
- Substitutions in dynamics, arithmetics and combinatorics
- On the number of factors of Sturmian words
- The structure of subword graphs and suffix trees of Fibonacci words
- On Sturmian graphs
- Morse and Hedlund's skew Sturmian words revisited
- Burrows-Wheeler transform and Sturmian words
- The geometry of Markoff numbers
- The smallest automaton recognizing the subwords of a text
- Modified complexity and *-Sturmian word
- Counting permutations with given cycle structure and descent set
- Some combinatorial properties of Sturmian words
- Sturmian words: structure, combinatorics, and their arithmetics
- Sturmian words, Lyndon words and trees
- Imbalances in Arnoux-Rauzy sequences
- Episturmian words and episturmian morphisms
- Combinatorial, ergodic and arithmetic properties of the Tribonacci substitution
- On low-complexity bi-infinite words and their factors
- Generalized balances in Sturmian words
- A note on the Burrows-Wheeler transformation
- Digital straightness -- a review
- Palindrome complexity.
- Characterisations of balanced words via orderings
- Moments of conjugacy classes of binary words
- Random generation of finite Sturmian words
- Palindromes and Sturmian words
- Some properties of the Tribonacci sequence
- A characterization of balanced episturmian sequences
- Factor versus palindromic complexity of uniformly recurrent infinite words
- On the arithmetical complexity of Sturmian words
- Powers in a class of \(\mathcal A\)-strict standard episturmian words
- Characterizations of finite and infinite episturmian words via lexicographic orderings
- An extension of the Burrows-Wheeler transform
- On an involution of Christoffel words and Sturmian morphisms
- Codes of central Sturmian words
- Palindromic factors of billiard words
- Some characterizations of finite Sturmian words.
- Language structure of pattern Sturmian words
- Pseudopalindrome closure operators in free monoids
- Inequalities characterizing standard Sturmian and episturmian words
- Maximal pattern complexity of words over \(\ell\) letters
- Sturmian sequences and the lexicographic world
- On the number of Arnoux–Rauzy words
- Sequences of low arithmetical complexity
- The number of digital straight lines on an N*N grid
- A First Investigation of Sturmian Trees
- On the number of digital straight line segments
- Représentation géométrique de suites de complexité $2n+1$
- A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS
- On a characteristic property of ARNOUX–RAUZY sequences
- Jewels of Stringology
- A generalization of Sturmian sequences: Combinatorial structure and transcendence
- Maximal pattern complexity for discrete systems
- COMBINATORIAL PROPERTIES OF ARNOUX–RAUZY SUBSHIFTS AND APPLICATIONS TO SCHRÖDINGER OPERATORS
- On substitution invariant Sturmian words: an application of Rauzy fractals
- COMBINATORIAL PROPERTIES OF STURMIAN PALINDROMES
- Sequences with minimal block growth
- Symbolic Dynamics II. Sturmian Trajectories
- Episturmian words and some constructions of de Luca and Rauzy
This page was built for publication: Sturmian and Episturmian Words
