Sturmian words: structure, combinatorics, and their arithmetics
From MaRDI portal
Publication:1391137
DOI10.1016/S0304-3975(96)00310-6zbMath0911.68098MaRDI QIDQ1391137
Publication date: 22 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (only showing first 100 items - show all)
Episturmian words: a survey ⋮ Squares and cubes in Sturmian sequences ⋮ The palindromization map ⋮ Bit catastrophes for the Burrows-Wheeler transform ⋮ Abelian combinatorics on words: a survey ⋮ Unnamed Item ⋮ Episturmian words and some constructions of de Luca and Rauzy ⋮ A new estimate on complexity of binary generalized pseudostandard words ⋮ Substitution invariant Sturmian words and binary trees ⋮ COMBINATORIAL PROPERTIES OF STURMIAN PALINDROMES ⋮ MULTIPSEUDOPERIODIC WORDS ⋮ Central sets generated by uniformly recurrent words ⋮ On a group theoretic generalization of the Morse-Hedlund theorem ⋮ Combinatorial properties of smooth infinite words ⋮ Palindromic language of thin discrete planes ⋮ Exponents of Diophantine approximation in dimension 2 for a general class of numbers ⋮ RECENT RESULTS ON EXTENSIONS OF STURMIAN WORDS ⋮ Novel results on the number of runs of the Burrows-Wheeler-transform ⋮ On a generalization of Christoffel words: epichristoffel words ⋮ Reversals and palindromes in continued fractions ⋮ A geometrical characterization of factors of multidimensional billiard words and some applications ⋮ Powers in a class of \(\mathcal A\)-strict standard episturmian words ⋮ Palindromic Complexity of Trees ⋮ Aperiodic pseudorandom number generators based on infinite words ⋮ A palindromization map for the free group ⋮ Quasiperiodic and Lyndon episturmian words ⋮ A note on the Markov condition and central words ⋮ On the structure of bispecial Sturmian words ⋮ Farey codes and languages ⋮ Palindromic prefixes and episturmian words ⋮ Transformations for pairwise well-formed modes ⋮ Counting Lyndon factors ⋮ A periodicity result of partial words with one hole ⋮ \(\alpha\)-words and factors of characteristic sequences ⋮ On the least number of palindromes contained in an infinite word ⋮ Reversible Christoffel factorizations ⋮ Sturmian words, Lyndon words and trees ⋮ Standard Sturmian morphisms ⋮ Palindromes in circular words ⋮ Normalization of ternary generalized pseudostandard words ⋮ Counting distinct palindromes in a word in linear time ⋮ Reprint of: ``Palindromization and construction of Markoff triples ⋮ Open and closed factors in Arnoux-Rauzy words ⋮ Weak repetitions in Sturmian strings. ⋮ A note on differentiable palindromes. ⋮ Bifix codes and Sturmian words ⋮ On periodicity of generalized pseudostandard words ⋮ Sturmian and Episturmian Words ⋮ A standard correspondence on epicentral words ⋮ Palindromes and Sturmian words ⋮ Tilings and quasiperiodicity. ⋮ On a Generalization of Standard Episturmian Morphisms ⋮ Infinite self-shuffling words ⋮ A combinatorial view on string attractors ⋮ Palindromic closures using multiple antimorphisms ⋮ Graph connectivity, partial words, and a theorem of Fine and Wilf ⋮ On some problems related to palindrome closure ⋮ A hierarchy for circular codes ⋮ On generating binary words palindromically ⋮ The pseudopalindromic completion of regular languages ⋮ Return words in Sturmian and episturmian words ⋮ On a paper by Castelli, Mignosi, Restivo ⋮ Characterizations of finite and infinite episturmian words via lexicographic orderings ⋮ Abelian closures of infinite binary words ⋮ Generalised Fibonacci sequences constructed from balanced words ⋮ On an involution of Christoffel words and Sturmian morphisms ⋮ A characterization of fine words over a finite alphabet ⋮ On \(k\)-abelian palindromes ⋮ ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS ⋮ Longest arithmetic progressions of palindromes ⋮ Involutions of epicentral words ⋮ Describing the Set of Words Generated by Interval Exchange Transformation ⋮ Codes of central Sturmian words ⋮ Palindromic factors of billiard words ⋮ An extension of Christoffel duality to a subset of Sturm numbers and their characteristic words ⋮ On the fixed points of the iterated pseudopalindromic closure operator ⋮ Balancing and clustering of words in the Burrows-Wheeler transform ⋮ On the number of episturmian palindromes ⋮ Compressed string-matching in standard Sturmian words ⋮ Characteristic morphisms of generalized episturmian words ⋮ A generalized palindromization map in free monoids ⋮ Standard factors of Sturmian words ⋮ On z-factorization and c-factorization of standard episturmian words ⋮ On factorially balanced sets of words ⋮ Pseudopalindrome closure operators in free monoids ⋮ On Christoffel and standard words and their derivatives ⋮ A palindromization map on free monoids ⋮ On \(\theta\)-episturmian words ⋮ Palindromic richness ⋮ Palindromization and construction of Markoff triples ⋮ On Christoffel classes ⋮ Rings that are sums of two locally nilpotent subrings ⋮ Balanced Words Having Simple Burrows-Wheeler Transform ⋮ A conjecture on continued fractions ⋮ Counter-intuitive answers to some questions concerning minimal-palindromic extensions of binary words ⋮ Harmonic and gold Sturmian words ⋮ Accessible points of planar embeddings of tent inverse limit spaces ⋮ Balanced words and dynamical systems ⋮ SOME EXTREMAL PROPERTIES OF THE FIBONACCI WORD ⋮ On graphs of central episturmian words
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the number of factors of Sturmian words
- Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.)
- A combinatorial property of the Fibonacci words
- Some combinatorial properties of Sturmian words
- Infinite words with linear subword complexity
- On continued fractions and finite automata
- Descriptions of the Characteristic Sequence of an Irrational
- A remark on morphic sturmian words
- Uniqueness Theorems for Periodic Functions
This page was built for publication: Sturmian words: structure, combinatorics, and their arithmetics