| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437300 | Theoretical Computer Science | 2011 | 16 Pages |
Abstract
We deal with the subword complexity of uniform D0L words obtained from group substitutions. Our main interest is whether the subword complexity is “almost proportional” to the length of the factor. We find necessary and sufficient conditions for that. For some cases we show that this is impossible.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
