| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437233 | Theoretical Computer Science | 2012 | 8 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
