Some properties of the singular words of the Fibonacci word
European Journal of Combinatorics
Random generation of finite Sturmian words
FPSAC '93 Proceedings of the 5th conference on Formal power series and algebraic combinatorics
Burrows--Wheeler transform and Sturmian words
Information Processing Letters
Characterisations of balanced words via orderings
Theoretical Computer Science
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Some characterizations of finite Sturmian words
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Some Characterizations of Sturmian Words in Terms of the Lexicographic Order
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
| Hi-index | 5.23 |
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.