期刊
THEORETICAL COMPUTER SCIENCE
卷 777, 期 -, 页码 232-242出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.tcs.2018.12.015
关键词
Generalized Lyndon words; Nonincreasing Lyndon factorization; Alternating lexicographical order
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据