scientific article; zbMATH DE number 7559170

DOI10.4230/LIPIcs.CPM.2019.2MaRDI QIDQ5088889

Francesco Dolce, Christophe Reutenauer, Antonio Restivo

Publication date: 18 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

infinite wordsLyndon wordsleft Cartesian treesleft Lyndon trees

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A bijection between words and multisets of necklaces
• Free Lie algebras and free monoids. Bases of free Lie algebras and factorizations of free monoids
• Counting permutations with given cycle structure and descent set
• Lyndon words, permutations and trees.
• Block sorting-based transformations on words: beyond the magic BWT
• The maximal number of cubic runs in a word
• Cartesian and Lyndon trees
• On generalized Lyndon words
• An extension of the Burrows-Wheeler transform
• Generalized Lyndon words
• Factorizing words over an ordered alphabet
• Combinatorics on Words
• Fast parallel Lyndon factorization with applications
• SORTING CONJUGATES AND SUFFIXES OF WORDS IN A MULTISET
• The “Runs” Theorem
• A new characterization of maximal repetitions by Lyndon trees
• Centralizers in Free Associative Algebras
• On Burnside's Problem

This page was built for publication: