Random generation of finite Sturmian words
From MaRDI portal
Publication:1917511
DOI10.1016/0012-365X(95)00125-GzbMath0848.68078OpenAlexW2171400130MaRDI QIDQ1917511
Jean Berstel, Michel Pocchiola
Publication date: 3 September 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(95)00125-g
Combinatorics on words (68R15) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (9)
Statistical problems related to irrational rotations ⋮ A note on Sturmian words ⋮ Sturmian and Episturmian Words ⋮ Counting minimal semi-Sturmian words ⋮ Some characterizations of finite Sturmian words. ⋮ Factors of characteristic words of irrational numbers ⋮ Infinite labeled trees: from rational to Sturmian trees ⋮ Studies on finite Sturmian words ⋮ Algorithmic analysis of irrational rotations in a single neuron model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quasicrystallographic tilings
- On the number of factors of Sturmian words
- Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.)
- The geometry of Markoff numbers
- Analytic models and ambiguity of context-free languages
- Substitution dynamical systems - spectral analysis
- Fibonacci morphisms and Sturmian words
- Some combinatorial properties of Sturmian words
- A linear algorithm for nonhomogeneous spectra of numbers
- The number of digital straight lines on an N*N grid
- Vision Geometry
- Beatty Sequences, Continued Fractions, and Certain Shift Operators
- Determination of [nθ by its Sequence of*Differences]
- A Characterization of the Quadratic Irrationals
- A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS
- Pizza Slicing, Phi's and the Riemann Hypothesis
- Sturmian Minimal Sets
This page was built for publication: Random generation of finite Sturmian words
