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

Abstract: Let

L_{k, a l p h a}^{m a t h b b Z}

denote the set of all bi-infinite

a l p h a

-power free words over an alphabet with

k

letters, where

a l p h a

is a positive rational number and

k

is positive integer. We prove that if

a l p h a g e q 5

,

k g e q 3

,

v i n L_{k, a l p h a}^{m a t h b b Z}

, and

w

is a finite factor of

v

, then there are

w i d e t i l d e v i n L_{k, a l p h a}^{m a t h b b Z}

and a letter

x

such that

w

is a factor of

w i d e t i l d e v

and

x

has only a finitely many occurrences in

w i d e t i l d e v

.

Recommendations

Cites work

Cited in

(3)

This page was built for publication: Construction of a bi-infinite power free word with a given factor and a non-recurrent letter