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

zbMATH Open1543.11031MaRDI QIDQ6546706

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Cyclic complexity of words
• Palindrome complexity.
• Synchronized sequences
• Abelian complexity of minimal subshifts
• The Maximum Order Complexity of Sequence Ensembles
• On a group theoretic generalization of the Morse-Hedlund theorem
• Subword Complexity and k-Synchronization
• Factor complexity
• Progress in Cryptology - INDOCRYPT 2003

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)