Reprint of: ``-Lyndon words

Abstract: Let

A

be a finite non-empty set and

p r e c e q

a total order on

A^{a} t s

verifying the following lexicographic like condition: For each

n i n a t s

and

u, v i n A^{n},

if

u^{o} m e g a p r e c v^{o} m e g a

then

u x p r e c v y

for all

x, y i n A^{a} t s .

A word

x i n A^{a} t s

is called

o m e g a

-Lyndon if

x p r e c y

for each proper suffix

y

of

x .

A finite word

w i n A^{+}

is called

o m e g a

-Lyndon if

w^{o} m e g a p r e c v^{o} m e g a

for each proper suffix

v

of

w .

In this note we prove that every infinite word may be written uniquely as a non-increasing product of

o m e g a

-Lyndon words.

Recommendations

Cites work

Cited in

(4)

This page was built for publication: Reprint of: ``\(\omega\)-Lyndon words