The average cost of Duval's algorithm for generating all Lyndon words up to a given length in lexicographic order is proved to be asymptotically equal to (q + ...
The average cost of Duval's algorithm for generating all Lyndon words up to a given length in lexicographic order is proved to be asymptotically.
The average cost of Duval's algorithm for generating all Lyndon words up to a given length in lexicographic order is proved to be asymptotically equal to (q ...
[PDF] Average Cost of Duval's Algorithm for Generating Lyndon Words
www.di.ens.fr › liens-92-8.A4.pdf
Mar 30, 1992 · One of the basic properties of the set of Lyndon words is that every word admits a uniquely factorizable as a non increasing product of Lyndon.
This work generalizes the concepts of Lyndon words and de Bruijn sequence to the language of subshifts of finite type, extending its properties to this more ...
The average cost of Duval's algorithm for generating all Lyndon words up to a given length in lexicographic order is proved to be asymptotically equal to (q + 1)/( ...
The average cost of Duval's algorithm for generating all Lyndon words up to a given length in lexicographic order is proved to be asymptotically equal to (q ...
mentions another algorithm for generating Lyndon words Average cost of Duval's algorithm 425 would mean that the computation of an interval of Lyndon word costs ...
Sep 9, 2022 · (Please refer to the paper “Average cost of Duval's algorithm for generating Lyndon words” by Berstel et al. for the proof) The algorithm ...
Jean Berstel, Michel Pocchiola: Average Cost of Duval's Algorithm for Generating Lyndon Words. Theor. Comput. Sci. 132(2): 415-425 (1994).