Back to Search
Start Over
The subword complexity of a class of infinite binary words
- Source :
-
Advances in Applied Mathematics . Aug2007, Vol. 39 Issue 2, p237-259. 23p. - Publication Year :
- 2007
-
Abstract
- Abstract: The gap function of an infinite word over the binary alphabet 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. [Copyright &y& Elsevier]
- Subjects :
- *ALGORITHMS
*ALGEBRA
*MATHEMATICAL analysis
*MATHEMATICS
Subjects
Details
- Language :
- English
- ISSN :
- 01968858
- Volume :
- 39
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- Advances in Applied Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 25181956
- Full Text :
- https://doi.org/10.1016/j.aam.2006.04.001