Papers
Topics
Authors
Recent
Search
2000 character limit reached

Repetition factorization of automatic sequences

Published 25 Nov 2023 in cs.FL, cs.DM, and math.CO | (2311.14961v2)

Abstract: Following Inoue et al., we define a word to be a repetition if it is a (fractional) power of exponent at least 2. A word has a repetition factorization if it is the product of repetitions. We study repetition factorizations in several (generalized) automatic sequences, including the infinite Fibonacci word, the Thue-Morse word, paperfolding words, and the Rudin-Shapiro sequence.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (2)

  1. Jeffrey Shallit 
  2. Xinhao Xu 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up