A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS
From MaRDI portal
Publication:4286028
DOI10.1142/S0218196793000238zbMath0802.68099OpenAlexW2061723820MaRDI QIDQ4286028
Jean Berstel, Michel Pocchiola
Publication date: 23 March 1994
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218196793000238
Combinatorics on words (68R15) Formal languages and automata (68Q45) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Complexity and growth for polygonal billiards ⋮ Canonical positions for the factors in paperfolding sequences ⋮ Billiard complexity in the hypercube ⋮ On the arithmetical complexity of Sturmian words ⋮ Some combinatorial properties of Sturmian words ⋮ Generalized Hausdorff dimensions of sets of real numbers with zero entropy expansion ⋮ Random generation of finite Sturmian words ⋮ A representation theorem of the suffixes of characteristic sequences ⋮ A new geometric approach to Sturmian words ⋮ Sturmian and Episturmian Words ⋮ Combinatorial properties of sequences defined by the billiard in the tesselation triangles ⋮ On a combinatorial property of Sturmian words ⋮ Digital Straightness ⋮ Factors of characteristic words of irrational numbers ⋮ Languages under substitutions and balanced words ⋮ Enumeration formula for \((2,n)\)-cubes in discrete planes ⋮ On the min DSS problem of closed discrete curves ⋮ Digital straightness -- a review ⋮ Well-balanced sequences ⋮ Combinatorial, ergodic and arithmetic properties of the Tribonacci substitution ⋮ On low-complexity bi-infinite words and their factors ⋮ Asymptotic formula for balanced words
This page was built for publication: A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS
