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 denote the set of all bi-infinite -power free words over an alphabet with letters, where is a positive rational number and is positive integer. We prove that if , , , and is a finite factor of , then there are and a letter such that is a factor of and has only a finitely many occurrences in .
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}
}