Words over an ordered alphabet and suffix permutations

Jean-Pierre Duval, Arnaud Lefebvre
2002 RAIRO - Theoretical Informatics and Applications  
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
more » ... near time or for computing the set of Lyndon words of length n. Mathematics Subject Classification. 68R15. * This work was partially supported by a NATO grant PST.CLG.977017.
doi:10.1051/ita:2002012 fatcat:u45ukr5muvbelnbbxaf7iw6s6e