Repetitions in infinite palindrome-rich words

DOI10.1007/978-3-030-28796-2_7zbMath1447.68010arXiv1904.10028OpenAlexW3104436475MaRDI QIDQ2333034

Aseem Baranwal, Jeffrey O. Shallit

Publication date: 6 November 2019

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

zbMATH Keywords

critical exponentpalindromerepetitionsrich wordsPell numeration systemWalnut softwareWalnut solver

Mathematics Subject Classification ID

Combinatorics on words (68R15) Mechanization of proofs and logical operations (03B35) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (5)

On Morphisms Preserving Palindromic Richness ⋮ Complementary symmetric Rote sequences: the critical exponent and the recurrence function ⋮ Interview with Jeffrey Shallit ⋮ Ostrowski-automatic sequences: theory and applications ⋮ The repetition threshold for binary rich words

Uses Software

• Walnut

This page was built for publication: Repetitions in infinite palindrome-rich words