Rich, Sturmian, and trapezoidal words

DOI10.1016/j.tcs.2008.06.009zbMath1153.68045arXiv0802.3885OpenAlexW1979358057MaRDI QIDQ955036

Luca Q. Zamboni, Amy Glen, Aldo De Luca

Publication date: 18 November 2008

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

Full work available at URL: https://arxiv.org/abs/0802.3885

zbMATH Keywords

Sturmian wordspalindromesrich wordspalindromic complexitytrapezoidal words

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (17)

Scattered Factor-Universality of Words ⋮ Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences ⋮ Episturmian words: a survey ⋮ On the least number of palindromes contained in an infinite word ⋮ Extensions of rich words ⋮ Absent Subsequences in Words ⋮ Complexity and palindromic defect of infinite words ⋮ On generalized highly potential words ⋮ Unnamed Item ⋮ Ostrowski-automatic sequences: theory and applications ⋮ Generalized trapezoidal words ⋮ Special factors and the combinatorics of suffix and factor automata ⋮ A new characteristic property of rich words ⋮ The repetition threshold for binary rich words ⋮ Palindromic rich words and run-length encodings ⋮ Rich and Periodic-Like Words ⋮ Rich square-free words

Cites Work

• Unnamed Item
• Structure of \(K\)-interval exchange transformations: induction, trajectories, and distance theorems
• Palindromic richness
• On the combinatorics of finite words
• A combinatorial problem on trapezoidal words.
• Palindromes and Sturmian words
• Palindromic complexity of infinite words associated with simple Parry numbers
• A connection between palindromic and factor complexity using return words
• Some characterizations of finite Sturmian words.
• Languages of k -interval exchange transformations
• COMBINATORIAL PROPERTIES OF STURMIAN PALINDROMES
• Episturmian words and some constructions of de Luca and Rauzy

This page was built for publication: Rich, Sturmian, and trapezoidal words