×

Words over an ordered alphabet and suffix permutations. (English) Zbl 1013.68153

Summary: Given an ordered alphabet and a permutation, according to the lexicographic order, on the set of suffixes of a word \(w\), we present in this article a linear time and space method to determine whether a word \(w'\) has the same permutation on its suffixes. Using this method, we are then also able to build the class of all the words having the same permutation on their suffixes, first of all the smallest one. Finally, we note that this work can lead to a method for generating a Lyndon word randomly in linear time or for computing the set of Lyndon words of length \(n\).

MSC:

68R15 Combinatorics on words
PDF BibTeX XML Cite
Full Text: DOI Numdam Numdam EuDML

References:

[1] M. Crochemore , C. Hancart and T. Lecroq , Algorithmique du texte . Vuibert ( 2001 ). Zbl 1134.68300 · Zbl 1134.68300
[2] J.-P. Duval , Factorizing Words over an Ordered Alphabet . J. Algorithms 4 ( 1983 ) 363 - 381 . MR 729232 | Zbl 0532.68061 · Zbl 0532.68061
[3] E.M. McCreight , A Space-Economical Suffix Tree Construction Algorithm . J. Algorithms 23 ( 1976 ) 262 - 272 . MR 413594 | Zbl 0329.68042 · Zbl 0329.68042
[4] C. Hohlweg and C. Reutenauer , Lyndon words, permutations and trees , Rapport interne 2002 - 017 . Universit√© Louis Pasteur de Strasbourg. MR 2022847 | Zbl 1058.68086 · Zbl 1058.68086
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.