1989 InfiniteWordswithLinearSubwordC
Jump to navigation
Jump to search
- (Mignosi, 1989) ⇒ Filippo Mignosi. (1989). “Infinite Words with Linear Subword Complexity.” In: Theoretical Computer Science, 65(2).
Subject Headings:
Notes
Cited By
Quotes
Abstract
In Section 1 we study the relations among some combinatorial properties of infinite words, especially in the case of infinite words with linear subword complexity; the main result of Section 1 concerns a permutation property of infinite words with linear complexity. In Section 2 we investigate the special case of the sturmian infinite words; the main result is that a sturmian infinite word associated to a real number $\alpha$ contains no $kth$ powers iff $\alpha$ has a continued fraction expansion with bounded partial quotients. In Section 3 it is shown that some of the results of Sections 1 and 2 are optimal.
References
;
| Author | volume | Date Value | title | type | journal | titleUrl | doi | note | year | |
|---|---|---|---|---|---|---|---|---|---|---|
| 1989 InfiniteWordswithLinearSubwordC | Filippo Mignosi | Infinite Words with Linear Subword Complexity | 1989 |