Euclidean strings

DOI10.1016/S0304-3975(02)00589-3zbMath1028.68107OpenAlexW2914993520MaRDI QIDQ1399993

D. Massart

Publication date: 30 July 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00589-3

zbMATH Keywords

Euclidean algorithmmorphismStern-Brocot treeSturmian sequenceChristoffel wordLyndon wordBeatty sequenceFibonacci stringrational mechanical sequence

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (2)

Structural properties of Euclidean rhythms ⋮ Music and combinatorics on words: a historical survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The exact number of squares in Fibonacci words
• Complexity of generalized Rudin-Shapiro sequences
• Some combinatorial properties of Sturmian words
• Palindromes in the Fibonacci word
• Sturmian words, Lyndon words and trees
• A characterization of the squares in a Fibonacci string
• The Number of Irreducible Polynomials and Lyndon Words with Given Trace
• Recounting the Rationals
• Many to One Embeddings from Grids into Cylinders, Tori, and Hypercubes
• The Bracket Function and Complementary Sets of Integers
• Some properties of the singular words of the Fibonacci word

This page was built for publication: Euclidean strings