On the factors of the Sturmian sequences
Theoretical Computer Science
On the number of factors of Sturmian words
Theoretical Computer Science
Random generation of finite Sturmian words
FPSAC '93 Proceedings of the 5th conference on Formal power series and algebraic combinatorics
Balanced sequences and optimal routing
Journal of the ACM (JACM)
Some characterizations of finite Sturmian words
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
On minimal Sturmian partial words
Discrete Applied Mathematics
| Hi-index | 0.04 |
A finite Sturmian word w is a balanced word over the binary alphabet {a,b}, that is, for all subwords u and v of w of equal length, ||u|"a-|v|"a|@?1, where |u|"a and |v|"a denote the number of occurrences of the letter a in u and v, respectively. There are several other characterizations, some leading to efficient algorithms for testing whether a finite word is Sturmian. These algorithms find important applications in areas such as pattern recognition, image processing, and computer graphics. Recently, Blanchet-Sadri and Lensmire considered finite semi-Sturmian words of minimal length and provided an algorithm for generating all of them using techniques from graph theory. In this paper, we exploit their approach in order to count the number of minimal semi-Sturmian words. We also present some other results that come from applying this graph theoretical framework to subword complexity.