| Issue |
RAIRO-Theor. Inf. Appl.
Volume 36, Number 3, July/September 2002
|
|
|---|---|---|
| Page(s) | 249 - 259 | |
| DOI | https://doi.org/10.1051/ita:2002012 | |
| Published online | 15 December 2002 | |
Words over an ordered alphabet and suffix permutations
1
LIFAR-ABISS, Faculté des Sciences, Université de Rouen,
76821 Mont-Saint-Aignan Cedex, France;
jean-pierre.duval@univ-rouen.fr.
2
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
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
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.