On theta-palindromic richness

DOI10.1016/j.tcs.2010.12.011zbMath1211.68302arXiv1005.0722MaRDI QIDQ631773

Štěpán Starosta

Publication date: 14 March 2011

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

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

zbMATH Keywords

combinatorics on words; rich words; pseudopalindrome; theta-episturmian words; theta-palindrome

Mathematics Subject Classification ID

68R15: Combinatorics on words

Related Items

ALMOST RICH WORDS AS MORPHIC IMAGES OF RICH WORDS, Languages invariant under more symmetries: overlapping factors versus palindromic richness, Palindromic richness for languages invariant under more symmetries, Palindromic closures using multiple antimorphisms, Enumeration of two dimensional palindromes, Generalized Thue-Morse words and palindromic richness

Cites Work

• On \(\theta\)-episturmian words
• Palindromic richness
• Palindromes and Sturmian words
• A new characteristic property of rich words
• Palindromic complexity of infinite words associated with simple Parry numbers
• Factor versus palindromic complexity of uniformly recurrent infinite words
• A connection between palindromic and factor complexity using return words
• On different generalizations of episturmian words
• Sturmian jungle (or garden?) on multiliteral alphabets
• ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
• Sturmian and Episturmian Words
• Episturmian words: a survey
• Episturmian words and some constructions of de Luca and Rauzy