On generalized Lyndon words

DOI10.1016/j.tcs.2018.12.015zbMath1426.68229arXiv1812.04515OpenAlexW2963216768MaRDI QIDQ2422029

Antonio Restivo, Christophe Reutenauer, Francesco Dolce

Publication date: 18 June 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.04515

zbMATH Keywords

Lyndon wordsalternating lexicographical ordergeneralized Lyndon wordsnonincreasing Lyndon factorization

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (12)

Lyndon words formalized in Isabelle/HOL ⋮ Linear construction of a left Lyndon tree ⋮ Reprint of: ``\(\omega\)-Lyndon words ⋮ Reprint of: ``Generalized Lyndon factorizations of infinite words ⋮ String rearrangement inequalities and a total order between primitive words ⋮ Computing longest Lyndon subsequences and longest common Lyndon subsequences ⋮ Constructing and indexing the bijective and extended Burrows-Wheeler transform ⋮ On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties ⋮ Unnamed Item ⋮ \( \omega \)-Lyndon words ⋮ The alternating BWT: an algorithmic perspective ⋮ Generalized Lyndon factorizations of infinite words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lyndon + Christoffel = digitally convex
• On translating one polyomino to tile the plane
• Infinite Lyndon words
• Inverse Lyndon words and inverse Lyndon factorizations of words
• Cartesian and Lyndon trees
• Nyldon words
• Generalized Lyndon words
• Factorizing words over an ordered alphabet
• Transfinite Lyndon Words
• Fast parallel Lyndon factorization with applications
• SORTING CONJUGATES AND SUFFIXES OF WORDS IN A MULTISET
• Centralizers in Free Associative Algebras
• On Burnside's Problem

This page was built for publication: On generalized Lyndon words