منابع مشابه
Average Cost of Duval's Algorithm for Generating Lyndon Words Average Cost of Duval's Algorithm for Generating Lyndon Words
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)=(q ? 1), where q is the size of the underlying alphabet. In particular, the average cost is independent of the length of the words generated. A precise evaluation of the constants is also given.
متن کاملGenerating Lyndon brackets.: An addendum to: Fast algorithms to generate necklaces, unlabeled necklaces and irreducible polynomials over GF(2)
It is well known that the Lyndon words of length n can be used to construct a basis for the n-th homogeneous component of the free Lie algebra. We develop an algorithm that uses a dynamic programming table to efficiently generate the standard bracketing for all Lyndon words of length n, thus constructing a basis for the n-th homogeneous component of the free Lie algebra. The algorithm runs in l...
متن کاملAverage Cost of Duval's Algorithm for Generating Lyndon Words
Berstel, J. and M. Pocchiola, Average cost of Duval’s algorithm for generating Lyndon words, Theoretical Computer Science 132 (1994) 415-425. 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+ l)/(ql), where 4 is the size of the underlying alphabet. In particular, the average cost is indep...
متن کاملSudo-Lyndon
Based on Lyndon words, a new Sudoku-like puzzle is presented and some relative theoretical questions are proposed.
متن کاملCounting Lyndon Factors
In this paper, we determine the maximum number of distinct Lyndon factors that a word of length n can contain. We also derive formulas for the expected total number of Lyndon factors in a word of length n on an alphabet of size σ, as well as the expected number of distinct Lyndon factors in such a word. The minimum number of distinct Lyndon factors in a word of length n is 1 and the minimum tot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms
سال: 2003
ISSN: 0196-6774
DOI: 10.1016/s0196-6774(02)00286-9