Languages invariant under more symmetries: overlapping factors versus palindromic richness

DOI10.1016/j.disc.2013.07.002zbMath1279.05002arXiv1103.4051OpenAlexW2071830879MaRDI QIDQ389460

Edita Pelantová, Štěpán Starosta

Publication date: 20 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

symmetriesThue-Morse wordoverlapsgroup palindromic richnesspalindromic richness

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05)

Related Items (12)

Palindromic richness for languages invariant under more symmetries ⋮ Complementary symmetric Rote sequences: the critical exponent and the recurrence function ⋮ Morphisms generating antipalindromic words ⋮ An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence ⋮ On generalized highly potential words ⋮ Palindromic closures using multiple antimorphisms ⋮ Ostrowski-automatic sequences: theory and applications ⋮ Morphic images of episturmian words having finite palindromic defect ⋮ Generalized Thue-Morse words and palindromic richness ⋮ The repetition threshold for binary rich words ⋮ On highly palindromic words: the ternary case ⋮ Rich square-free words

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Palindromic richness for languages invariant under more symmetries
• Complexity and palindromic defect of infinite words
• On theta-palindromic richness
• Substitutions in dynamics, arithmetics and combinatorics
• On Brlek-Reutenauer conjecture
• Infinite words with finite defect
• Palindromic richness
• Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
• Complexity and special factors
• Palindrome complexity bounds for primitive substitution sequences
• Enumeration of factors in the Thue-Morse word
• Palindrome complexity.
• Singular continuous spectrum for palindromic Schrödinger operators
• 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
• ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
• Infinite Words Rich and Almost Rich in Generalized Palindromes
• Episturmian words and some constructions of de Luca and Rauzy

This page was built for publication: Languages invariant under more symmetries: overlapping factors versus palindromic richness