Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.)
From MaRDI portal
Publication:909477
DOI10.1016/0304-3975(90)90050-RzbMath0694.68048OpenAlexW1969264819MaRDI QIDQ909477
Dulucq, Serge, Dominique Gouyou-Beauchamps
Publication date: 1990
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(90)90050-r
Related Items (38)
Canonical positions for the factors in paperfolding sequences ⋮ On complementary triples of Sturmian bisequences ⋮ Moments of conjugacy classes of binary words ⋮ Some combinatorial properties of Sturmian words ⋮ Random generation of finite Sturmian words ⋮ Random and uniform generation of words ⋮ On the conjugation of standard morphisms ⋮ Sturmian words: structure, combinatorics, and their arithmetics ⋮ Sturmian words, Lyndon words and trees ⋮ Combinatoire de mots récurrents de complexitén+2 ⋮ Palindromes and Sturmian words ⋮ Sturmian morphisms and \(\alpha\)-words ⋮ Counting minimal semi-Sturmian words ⋮ Fibonacci morphisms and Sturmian words ⋮ Decimations and sturmian words ⋮ Combinatorial properties of sequences defined by the billiard in the tesselation triangles ⋮ On a combinatorial property of Sturmian words ⋮ Generalized Sturmian languages ⋮ Digital Straightness ⋮ Factors of characteristic words of irrational numbers ⋮ On factorially balanced sets of words ⋮ On the min DSS problem of closed discrete curves ⋮ Geometric interpretation of the Euclidean algorithm and recognition of segments ⋮ Language complexity of rotations and Sturmian sequences ⋮ Intertwinings of periodic sequences ⋮ Digital straightness -- a review ⋮ Well-balanced sequences ⋮ Repetitions in Sturmian strings ⋮ The complexity of functions on lattices ⋮ Forbidden words in symbolic dynamics ⋮ Unnamed Item ⋮ On the number of factors of Sturmian words ⋮ A combinatorial problem on trapezoidal words. ⋮ Balance properties of multi-dimensional words ⋮ Combinatorial, ergodic and arithmetic properties of the Tribonacci substitution ⋮ On low-complexity bi-infinite words and their factors ⋮ Sturmian morphisms and Rauzy's rules ⋮ Studies on finite Sturmian words
Cites Work
- Quasicrystallographic tilings
- The geometry of Markoff numbers
- Every iterated morphism yields a co-CFL
- Analytic models and ambiguity of context-free languages
- Beatty Sequences, Continued Fractions, and Certain Shift Operators
- Sequences with minimal block growth
- Sturmian Minimal Sets
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.)
