Construction of a bi-infinite power free word with a given factor and a non-recurrent letter

Abstract

Let Lk,αZ denote the set of all bi-infinite α-power free words over an alphabet with k letters, where α is a positive rational number and k is positive integer. We prove that if α≥ 5, k≥ 3, v∈ Lk,αZ, and w is a finite factor of v, then there are v∈ Lk,αZ and a letter x such that w is a factor of v and x has only a finitely many occurrences in v.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…