Theoret. Informatics Appl. 36, 249-259 (2002)
DOI: 10.1051/ita:2002012

Words over an ordered alphabet and suffix permutations

Jean-Pierre Duval¹ and Arnaud Lefebvre<sup>2

1</sup>  LIFAR-ABISS, Faculté des Sciences, Université de Rouen, 76821 Mont-Saint-Aignan Cedex, France; jean-pierre.duval@univ-rouen.fr.
²  ABISS, UMR 6037 du CNRS, Faculté des Sciences, Université de Rouen, 76821 Mont-Saint-Aignan Cedex, France; arnaud.lefebvre@univ-rouen.fr.

(Received January, 2002. Accepted October, 2002)

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

Mathematics Subject Classification. 68R15

Key words: Suffix permutation -- Lyndon words.


© EDP Sciences 2002

What is OpenURL?