Some combinatorial properties of Sturmian words
From MaRDI portal
DOI10.1016/0304-3975(94)00035-HzbMATH Open0874.68245OpenAlexW2006661113MaRDI QIDQ1349698FDOQ1349698
Authors: Filippo Mignosi, Aldo De Luca 
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00035-h
Recommendations
Cites Work
- Infinite words with linear subword complexity
- Title not available (Why is that?)
- Fast Pattern Matching in Strings
- Uniqueness Theorems for Periodic Functions
- Title not available (Why is that?)
- On the number of factors of Sturmian words
- A combinatorial property of the Fibonacci words
- Title not available (Why is that?)
- A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS
- Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.)
- Sturmian Minimal Sets
Cited In (only showing first 100 items - show all)
- Codes of central Sturmian words
- A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS
- RECENT RESULTS ON EXTENSIONS OF STURMIAN WORDS
- A Note on a Conjecture of Duval and Sturmian Words
- Combinatorial, ergodic and arithmetic properties of the Tribonacci substitution
- Frequencies of factors of Sturmian sequences
- Palindromic prefixes and episturmian words
- Sturmian graphs and integer representations over numeration systems
- Title not available (Why is that?)
- Words with many palindrome pair factors
- An extension of Christoffel duality to a subset of Sturm numbers and their characteristic words
- Minimal non-convex words
- Two-variable word equations
- Fine and Wilf's theorem for three periods and a generalization of Sturmian words
- On a generalization of Christoffel words: epichristoffel words
- Generalized balances in Sturmian words
- On Sturmian graphs
- A new geometric approach to Sturmian words
- COMBINATORIAL PROPERTIES OF STURMIAN PALINDROMES
- *-Sturmian words and complexity
- Languages under substitutions and balanced words
- Sturmian words and a criterium by Michaux-Villemaire
- Graph connectivity, partial words, and a theorem of Fine and Wilf
- Palindromes and Sturmian words
- A note on Sturmian words
- Sturmian jungle (or garden?) On multiliteral alphabets
- Burrows-Wheeler transform and Sturmian words
- Sturmian words: structure, combinatorics, and their arithmetics
- Sturmian words, Lyndon words and trees
- Automata and forbidden words
- A division property of the Fibonacci word
- A standard correspondence on epicentral words
- Repetitive perhaps, but certainly not boring
- On the number of episturmian palindromes
- Fine and Wilf words for any periods
- Occurrences of palindromes in characteristic Sturmian words
- Farey codes and languages
- Well-balanced sequences
- Locating factors of a characteristic word via the generalized Zeckendorf representation of numbers
- On an involution of Christoffel words and Sturmian morphisms
- Words and special factors
- Random generation of finite Sturmian words
- Pseudopalindrome closure operators in free monoids
- Palindromes in the Fibonacci word
- On graphs of central episturmian words
- Factors of characteristic words of irrational numbers
- Sturmian words and words with a critical exponent
- On bispecial factors of the Thue-Morse word
- On generating binary words palindromically
- Standard Sturmian morphisms
- Some properties of the factors of Sturmian sequences.
- Words and forbidden factors
- On the combinatorics of finite words
- Factors of characteristic words: location and decompositions
- Sturmian words and the Stern sequence
- Characterisations of balanced words via orderings
- On the conjugation of standard morphisms
- Forbidden words in symbolic dynamics
- Some characterizations of finite Sturmian words.
- A challenging family of automata for classical minimization algorithms
- Unbordered factors of the characteristic sequences of irrational numbers
- Harmonic and gold Sturmian words
- A Characterization of Bispecial Sturmian Words
- \(\alpha\)-words and factors of characteristic sequences
- A representation theorem of the suffixes of characteristic sequences
- Sturm numbers and substitution invariance of 3iet words
- Standard Sturmian words and automata minimization algorithms
- Moments of conjugacy classes of binary words
- Characteristic Sturmian words are extremal for the critical factorization theorem
- Sturmian morphisms and \(\alpha\)-words
- A remark on morphic sturmian words
- On Christoffel classes
- A palindromization map on free monoids
- Cyclic complexity of words
- Some combinatorial properties of words in discrete dynamical systems from antisymmetric cubic maps
- A square root map on Sturmian words
- Sturmian and Episturmian Words
- On low-complexity bi-infinite words and their factors
- Semiperiodic words and root-conjugacy.
- Developments in Language Theory
- Title not available (Why is that?)
- Novel results on the number of runs of the Burrows-Wheeler-transform
- Discrete segments of \(\mathbb{Z}^3\) constructed by synchronization of words
- Invariance properties of Sturmian words
- The Burrows-Wheeler transform between data compression and combinatorics on words
- Euclidean strings
- Weak repetitions in Sturmian strings.
- Obituary: Aldo de Luca 1941--2018
- Title not available (Why is that?)
- From the Fibonacci word to Sturmian words
- On Sturmian and episturmian words, and related topics
- Further steps on the reconstruction of convex polyominoes from orthogonal projections
- Minimal forbidden factors of circular words
- Three distance theorems and Sturmian sequences: length governing words
- On factorially balanced sets of words
- About \(k\) to \(k\) insertion words of Sturmian words
- On Christoffel and standard words and their derivatives
- A periodicity result of partial words with one hole
- Words that almost commute
- The sequence of open and closed prefixes of a Sturmian word
This page was built for publication: Some combinatorial properties of Sturmian words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1349698)
