On generalized Lyndon words

12/11/2018
by   Francesco Dolce, et al.
0

A generalized lexicographical order on infinite words is defined by choosing for each position a total order on the alphabet. This allows to define generalized Lyndon words. Every word in the free monoid can be factorized in a unique way as a nonincreasing factorization of generalized Lyndon words. We give new characterizations of the first and the last factor in this factorization as well as new characterization of generalized Lyndon words. We also give more specific results on two special cases: the classical one and the one arising from the alternating lexicographical order.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/12/2019

Generalized Lyndon Factorizations of Infinite Words

A generalized lexicographic order on words is a lexicographic order wher...
research
04/25/2018

Nyldon words

The Chen-Fox-Lyndon theorem states that every finite word over a fixed a...
research
08/19/2020

On the Notion of a Generalized Mapping on Multiset Spaces

This work presents a generalized notion of multiset mapping thus resolvi...
research
10/12/2022

Multilingual textual data: an approach through multiple factor analysis

This paper focuses on the analysis of open-ended questions answered in d...
research
04/01/2019

Some variations on Lyndon words

In this paper we compare two finite words u and v by the lexicographical...
research
02/05/2020

Avoidance of split overlaps

We generalize Axel Thue's familiar definition of overlaps in words, and ...
research
11/26/2019

Words Avoiding Reversed Factors, Revisited

In 2005, Rampersad and the second author proved a number of theorems abo...

Please sign up or login with your details

Forgot password? Click here to reset