On a combinatorial property of Sturmian words

DOI10.1016/0304-3975(95)00077-1zbMath0872.68144OpenAlexW2057991104MaRDI QIDQ672757

Giuseppe Pirillo, Jacques Justin

Publication date: 28 February 1997

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

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00077-1

zbMATH Keywords

Sturmian wordsinfinite wordsRees quotientfinite words

Mathematics Subject Classification ID

Combinatorics on words (68R15) Free semigroups, generators and relations, word problems (20M05)

Related Items (4)

Some properties of the \(k\)-bonacci words on infinite alphabet ⋮ Palindromes and Sturmian words ⋮ Decimations and sturmian words ⋮ Combinatorial and arithmetical properties of infinite words associated with non-simple quadratic Parry numbers

Cites Work

• Unnamed Item
• Unnamed Item
• On the number of factors of Sturmian words
• Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.)
• Permutation properties and the Fibonacci semigroup
• Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
• Fibonacci morphisms and Sturmian words
• On a combinatorial property of Fibonacci semigroup
• Sturmian morphisms and Rauzy's rules
• Infinite words and permutation properties
• Infinite words with linear subword complexity
• FACTORIAL LANGUAGES AND SOME COMBINATORIAL PROPERTIES OF SEMIGROUPS
• A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS
• Sequences with minimal block growth

This page was built for publication: On a combinatorial property of Sturmian words