Words over an ordered alphabet and suffix permutations

被引：25

作者：

Duval, JP ^{[1
]}

Lefebvre, A

机构：

[1] Univ Rouen, Fac Sci, LIFAR,ABISS, F-76821 Mont St Aignan, France

[2] Univ Rouen, Fac Sci, CNRS, UMR 6037,ABISS, F-76821 Mont St Aignan, France

来源：

RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS | 2002年 / 36卷 / 03期

关键词：

suffix permutation; Lyndon words;

D O I：

10.1051/ita:2002012

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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.

引用

页码：249 / 259

页数：11