Combinatorical and Algebraic Structures Seminar
Session details
Date: | 18.2.2020 |
Speaker: | Francesco Dolce, FJFI, České vysoké učení technické v Praze |
Title: | Generalized Lyndon words |
Abstract: | (spoluautoři: A. Restivo and C. Reutenauer) 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 non-increasing 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. |
Return to index.
last update: 27.9.2007, webmaster: Petr Ambrož