Journal
THEORETICAL COMPUTER SCIENCE
Volume 777, Issue -, Pages 232-242Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.tcs.2018.12.015
Keywords
Generalized Lyndon words; Nonincreasing Lyndon factorization; Alternating lexicographical order
Categories
Ask authors/readers for more resources
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. (C) 2019 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available