Common factors in automatic and Sturmian sequences
Abstract
In this short note we show that a k-automatic sequence and a Sturmian sequence cannot have arbitrarily large factors in common.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.