Rich and Periodic-Like Words

DOI10.1007/978-3-642-02737-6_11zbMath1247.68204OpenAlexW1579156765MaRDI QIDQ3637220

Michelangelo Bucci, Alessandro De Luca, Aldo De Luca

Publication date: 7 July 2009

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02737-6_11

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (5)

The sequence of open and closed prefixes of a Sturmian word ⋮ Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences ⋮ Morphic images of episturmian words having finite palindromic defect ⋮ Palindromic rich words and run-length encodings ⋮ Off-line and on-line algorithms for closed string factorization

Cites Work

• Unnamed Item
• Unnamed Item
• Rich, Sturmian, and trapezoidal words
• Palindromic richness
• On the combinatorics of finite words
• A combinatorial problem on trapezoidal words.
• Palindrome complexity.
• Semiperiodic words and root-conjugacy.
• A new characteristic property of rich words
• Palindromic complexity of infinite words associated with simple Parry numbers
• A connection between palindromic and factor complexity using return words
• Pseudopalindrome closure operators in free monoids
• Sturmian and Episturmian Words
• COMBINATORIAL PROPERTIES OF STURMIAN PALINDROMES
• Episturmian words and some constructions of de Luca and Rauzy
• Periodic-like words, periodicity, and boxes

This page was built for publication: Rich and Periodic-Like Words