English

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

Formal Languages and Automata Theory 2023-07-10 v2 Discrete Mathematics Combinatorics

Abstract

Let Lk,αZL_{k,\alpha}^{\mathbb{Z}} denote the set of all bi-infinite α\alpha-power free words over an alphabet with kk letters, where α\alpha is a positive rational number and kk is positive integer. We prove that if α5\alpha\geq 5, k3k\geq 3, vLk,αZv\in L_{k,\alpha}^{\mathbb{Z}}, and ww is a finite factor of vv, then there are v~Lk,αZ\widetilde v\in L_{k,\alpha}^{\mathbb{Z}} and a letter xx such that ww is a factor of v~\widetilde v and xx has only a finitely many occurrences in v~\widetilde v.

Keywords

Cite

@article{arxiv.2202.12038,
  title  = {Construction of a bi-infinite power free word with a given factor and a non-recurrent letter},
  author = {Josef Rukavicka},
  journal= {arXiv preprint arXiv:2202.12038},
  year   = {2023}
}