| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4625270 | Advances in Applied Mathematics | 2007 | 23 Pages |
Abstract
The gap function of an infinite word over the binary alphabet {0,1} gives the distances between consecutive 1's in this word. In this paper we study infinite binary words whose gap function is injective or “almost injective.” A method for computing the subword complexity of such words is given. A necessary and sufficient condition for a function to be the subword complexity function of a binary word whose gap function is increasing is obtained.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
