Pseudoperiodic words and a question of Shevelev

DOI10.46298/DMTCS.9919MaRDI QIDQ6599791

Jeffrey Shallit, Joseph Meleshko, Pascal Ochem, Sonja Linghui Shan

Publication date: 6 September 2024

Published in: Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

zbMATH Keywords

automatacritical exponentThue-Morse sequencepaperfolding sequenceRudin-Shapiro sequencepseudoperiodic wordTribonacci sequence

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Last cases of Dejean's conjecture
• Polynomial versus exponential growth in repetition-free binary words
• Thue, combinatorics on words, and conjectures inspired by the Thue-Morse sequence
• Logic and \(p\)-recognizable sets of integers
• Synchronized sequences
• Extremal overlap-free and extremal \(\beta\)-free binary words
• Pseudoperiodic Words
• A proof of Dejean’s conjecture
• A New Approach to the Paperfolding Sequences
• A generator of morphisms for infinite words
• Automatic Sequences
• Reducibility among Combinatorial Problems

Related Items (1)

Power-free complementary binary morphisms

This page was built for publication: Pseudoperiodic words and a question of Shevelev

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6599791)