Semantic Scholar Open Access 2018 23 sitasi

On generalized Lyndon words

F. Dolce A. Restivo C. Reutenauer

Lihat Sumber DOI

Abstrak

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.

Topik & Kata Kunci

Mathematics Computer Science

Penulis (3)

F. Dolce

A. Restivo

C. Reutenauer

Format Sitasi

APA MLA BibTeX

Dolce, F., Restivo, A., Reutenauer, C. (2018). On generalized Lyndon words. https://doi.org/10.1016/j.tcs.2018.12.015

Akses Cepat

Lihat di Sumber doi.org/10.1016/j.tcs.2018.12.015

Informasi Jurnal

Tahun Terbit: 2018
Bahasa: en
Total Sitasi: 23×
Sumber Database: Semantic Scholar
DOI: 10.1016/j.tcs.2018.12.015
Akses: Open Access ✓