Pseudoperiodic words and a question of Shevelev

DOI10.46298/DMTCS.9919MaRDI QIDQ6599791zbMATH OpenFDO

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

Publication date 6 September 2024

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/DMTCS.9919

zbMATH Keywords

automatacritical exponentpaperfolding sequencepseudoperiodic wordRudin-Shapiro sequenceThue-Morse sequenceTribonacci sequence

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• Pseudoperiodic words
• Multipseudoperiodic words
• On periodicity of generalized pseudostandard words
• On multiperiodic words
• On the periodicity of morphic words

Cites work

• A generator of morphisms for infinite words
• A new approach to the paperfolding sequences
• A proof of Dejean’s conjecture
• Automatic Sequences
• Extremal overlap-free and extremal -free binary words
• scientific article; zbMATH DE number 5604107 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• scientific article; zbMATH DE number 7428929 (Why is no real title available?)
• Last cases of Dejean's conjecture
• Logic and p-recognizable sets of integers
• Polynomial versus exponential growth in repetition-free binary words
• Pseudoperiodic words
• Reducibility among combinatorial problems
• Synchronized sequences
• Thue, combinatorics on words, and conjectures inspired by the Thue-Morse sequence

Cited in

(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)