COMBINATORIAL PROPERTIES OF STURMIAN PALINDROMES

DOI10.1142/S0129054106003991zbMath1096.68126MaRDI QIDQ5483374

Alessandro De Luca, Aldo De Luca

Publication date: 14 August 2006

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

Sturmian wordcentral wordspecial factorSturmian palindrome

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (12)

Arithmetics on Suffix Arrays of Fibonacci Words ⋮ A connection between palindromic and factor complexity using return words ⋮ A relation by palindromic subwords ⋮ A new geometric approach to Sturmian words ⋮ Sturmian and Episturmian Words ⋮ Rich, Sturmian, and trapezoidal words ⋮ Some characterizations of finite Sturmian words. ⋮ On the number of episturmian palindromes ⋮ Pseudopalindrome closure operators in free monoids ⋮ Rich and Periodic-Like Words ⋮ Local symmetry dynamics in one-dimensional aperiodic lattices: a numerical study ⋮ Studies on finite Sturmian words

Cites Work

• Unnamed Item
• Unnamed Item
• On the combinatorics of finite words
• Some combinatorial properties of Sturmian words
• Sturmian words: structure, combinatorics, and their arithmetics
• A combinatorial problem on trapezoidal words.
• Palindromes and Sturmian words
• Codes of central Sturmian words
• Palindromic factors of billiard words
• Automatic Sequences
• Episturmian words and some constructions of de Luca and Rauzy

This page was built for publication: COMBINATORIAL PROPERTIES OF STURMIAN PALINDROMES