Paper Info
Title
Special Factors of Sequences With Linear Subword Complexity
Abstract
In this paper, we prove the following result, which was conjectured by S. Ferenczi: if the complexity function of a sequence has linear growth, then its differences are bounded by a constant.
Year
Venue
Field
1995
Developments in Language Theory
Discrete mathematics,Computer science
DocType
Citations 
PageRank 
Conference
23
4.14
References 
Authors
1
1
Name
Order
Citations
PageRank
Julien Cassaigne128240.80