Generalized balances in Sturmian words (original) (raw)
2002, Discrete Applied Mathematics
An inÿnite word x on the {0; 1} alphabet is balanced if, given two factors of x; w and w , having the same length, the di erence between the number of 0's in w (denoted by |w|0) and the number of 0's in w is at most 1, i.e. ||w|0 − |w |0| 6 1. It is well known that an aperiodic word is Sturmian if and only if it is balanced.
Sign up for access to the world's latest research.
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Related papers
Sturmian words with balanced construction
In this paper we define Sturmian words with balanced construction. We formulate a fixed-point theorem for Sturmian words and analyze the set of all fixed points. The inspiration for this work came from the Kolakoski word and the general idea of self-reading sequences by Pȃun and Salomaa. The basis for this article is the author's earlier research on the influence of the continued fraction elements in the expansion of a ∈ ]0, 1[\Q on the construction of runs for the upper mechanical word with slope a and intercept 0.
Some characterizations of finite Sturmian words
Theoretical Computer Science, 2006
In this paper, we give some new characterizations of words which are finite factors of Sturmian words. An enumeration formula for primitive finite Sturmian words is given. Moreover, we provide two linear-time algorithms to recognize whether a finite word is Sturmian.
The number of runs in Sturmian words
Denote by S the class of standard Sturmian words. It is a class of highly compressible words extensively studied in combinatorics of words, including the well known Fibonacci words. The suffix automata for these words have a very particular structure. This implies a simple characterization (described in the paper by the Structural Lemma) of the periods of runs (maximal repetitions) in Sturmian words. Using this characterization we derive an explicit formula for the number ρ(w) of runs in words w ∈ S, with respect to their recurrences (directive sequences). We show that ρ(w) |w| ≤ 4 5 for each w ∈ S, and there is an infinite sequence of strictly growing words w k ∈ S such that lim k→∞ ρ(w k ) |w k | = 4 5 . The complete understanding of the function ρ for a large class S of complicated words is a step towards better understanding of the structure of runs in words. We also show how to compute the number of runs in a standard Sturmian word in linear time with respect to the size of its compressed representation (recurrences describing the word). This is an example of a very fast computation on texts given implicitly in terms of a special grammar-based compressed representation (usually of logarithmic size with respect to the explicit text).
Balance properties of multi-dimensional words
Theoretical Computer Science, 2002
A word u is called 1-balanced if for any two factors v and w of u of equal length, we have −16|v|i − |w|i61 for each letter i, where |v|i denotes the number of occurrences of i in the factor v. The aim of this paper is to extend the notion of balance to multi-dimensional words. We ÿrst characterize all 1-balanced words on Z n . In particular, we prove they are fully periodic for n ¿ 1. We then give a quantitative measure of non-balancedness for some words on Z 2 with irrational density, including two-dimensional Sturmian words.
Special factors, periodicity, and an application to Sturmian words
Acta Informatica, 2000
Let w be a finite word and n the least non-negative integer such that w has no right special factor of length n and its right factor of length n is unrepeated. We prove that if all the factors of another word v up to the length n + 1 are also factors of w, then v itself is a factor of w. A similar result for ultimately periodic infinite words is established. As a consequence, some 'uniqueness conditions' for ultimately periodic words are obtained as well as an upper bound for the rational exponents of the factors of uniformly recurrent non-periodic infinite words. A general formula is derived for the 'critical exponent' of a power-free Sturmian word. In particular, we effectively compute the 'critical exponent' of any Sturmian sequence whose slope has a periodic development in a continued fraction.
Usefulness of directed acyclic subword graphs in problems related to standard Sturmian words
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci words. The subword graphs of these words (especially their compacted versions) have a very special regular structure. In this paper we investigate this structure in more detail than in the previous papers and show how several syntactical properties of Sturmian words follow from their graph properties. Consequently simple alternative graph-based proofs of several known facts are presented. The very special structure of subword graphs leads also to special easy algorithms computing some parameters of Sturmain words: the number of subwords, the critical factorization point, lexicographically maximal suffixes, occurrences of subwords of a fixed length, and right special factors. These algorithms work in linear time with respect to n, the size of the compressed representation of the standard word, though the words themselves can be of exponential size with respect to n. Some of the computed parameters can be also of exponential size, however we provide their linear size compressed representations. This gives more examples of fast computations for highly compressed words. We introduce also a new concept related to standard words: Ostrowski automata.
Fine and Wilf's theorem for three periods and a generalization of Sturmian words
Theoretical Computer Science, 1999
We extend the theorem of Fine and Wilf to words having three periods. We then define the set 3-PER of words of maximal length for which such result does not apply. We prove that the set 3-PER and the sequences of complexity 2n + 1, introduced by Amoux and Rauzy to generalize Sturmian words, have the same set of factors.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.