Lyndon words, permutations and trees.
type: Item
instance of: scholarly article
title: Lyndon words, permutations and trees.
zbMATH Open document ID: 1058.68086
DOI: 10.1016/S0304-3975(03)00099-9
author: Christophe Hohlweg
author: Christophe Reutenauer
published in: Theoretical Computer Science
publication date: 2004-03-14T00:00:00Z
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 2056478
zbMATH Keywords: suffix standard permutation
MaRDI profile type: Publication
cites work: Free differential calculus. IV: The quotient groups of the lower central series
cites work: Q5458488
cites work: Alternating permutations and binary increasing trees
cites work: Factorizing words over an ordered alphabet
cites work: Q4111582
cites work: Counting permutations with given cycle structure and descent set
cites work: Sorting tree, nestling tree and inverse permutation
cites work: Q3659988
cites work: A Space-Economical Suffix Tree Construction Algorithm
cites work: Combinatorics of Hall trees and Hall words
cites work: Lyndon Words, Free Algebras and Shuffles
cites work: Longest Increasing and Decreasing Subsequences
cites work: Q4855565
cites work: Q3748279
cites work: Q4137181
cites work: A unifying look at data structures
Recommended article: Patterns in permutations and words.
Recommended article: Representation of Tree Permutations by Words
Recommended article: WORDS, DYCK PATHS, TREES, AND BIJECTIONS
Recommended article: Q4341774
Recommended article: Some permutations on Dyck words
Recommended article: Sturmian words, Lyndon words and trees
Recommended article: Lyndon factorization of the Prouhet words.
Recommended article: Q5752601
Recommended article: Permutations, parenthesis words, and Schröder numbers
Recommended article: Lyndon partial words and arrays with applications
description: scientific article; zbMATH DE number 2056478