Proof of a conjecture of Krawchuk and Rampersad on the cyclic complexity of the Thue-Morse sequence

MaRDI QIDQ6546706zbMATH OpenFDO

Authors Jeffrey Shallit

Publication date 30 May 2024

Published in Integers (Search for Journal in Brave)

zbMATH Keywords

regular sequencesThue-Morse wordcyclic complexityWalnutautomatic words

Mathematics Subject Classification ID

Combinatorics on words (68R15) Automata sequences (11B85)

Recommendations

• Thue, combinatorics on words, and conjectures inspired by the Thue-Morse sequence
• Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture
• scientific article; zbMATH DE number 7069796
• Cyclic complexity of words
• On the abelian complexity of generalized Thue-Morse sequences

Cites work

• scientific article; zbMATH DE number 1740032 (Why is no real title available?)
• scientific article; zbMATH DE number 7069796 (Why is no real title available?)
• Abelian complexity of minimal subshifts
• Cyclic complexity of words
• Factor complexity
• Noncommutative rational series with applications
• On a group theoretic generalization of the Morse-Hedlund theorem
• Palindrome complexity.
• Progress in Cryptology - INDOCRYPT 2003
• Subword complexity and \(k\)-synchronization
• Synchronized sequences
• The Maximum Order Complexity of Sequence Ensembles

This page was built for publication: Proof of a conjecture of Krawchuk and Rampersad on the cyclic complexity of the Thue-Morse sequence

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