Words over an ordered alphabet and suffix permutations

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 b...

Full description

Saved in:
Bibliographic Details
Published inRAIRO. Informatique théorique et applications Vol. 36; no. 3; pp. 249 - 259
Main Authors Duval, Jean-Pierre, Lefebvre, Arnaud
Format Journal Article
LanguageEnglish
Published EDP Sciences 01.07.2002
Subjects
68R15
Lyndon words
Suffix permutation
Online AccessGet full text

Cover

More Information
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 .
Bibliography:PII:S0988375402000127
ark:/67375/80W-ZQB644V5-W
publisher-ID:ita0214
istex:2E57961446E900D6B0CA23290DD689484162981B
ISSN:0988-3754
1290-385X
DOI:10.1051/ita:2002012