3 research outputs found
Counting Minimal Semi-Sturmian Words
A finite Sturmian word w is a balanced word over the binary alphabet {a,b}, that is, for all subwords u andv of w of equal length, ||u|a-|v|a|=1, where |u|a and |v|a denote the number of occurrences of the lettera 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
Decomposition of Beatty and Complementary Sequences
In this paper we express the difference of two complementary Beatty
sequences, as the sum of two Beatty sequences closely related to them. In the
process we introduce a new Algorithm that generalizes the well known Minimum
Excluded algorithm and provides a method to generate combinatorially any pair
of complementary Beatty sequences.Comment: 17 pages including reference
Decomposition of Beatty and Complementary Sequences
In this paper we express the difference of two complementary Beatty sequences, as the sum of two Beatty sequences closely related to them. In the process we introduce a new Algorithm that generalizes the well known Minimum Excluded algorithm and provides a method to generate combinatorially any pair of complementary Beatty sequences