科研之友
微信
新浪微博
Facebook
分享链接
摘要
We describe an algorithm which, given a factor of a Sturmian word, computes the next factor of the same length in the lexicographic order in linear time. It is based on a combinatorial property of Sturmian words which is related with the Burrows-Wheeler transformation.
- 出版日期2012-4-20
