| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438385 | Theoretical Computer Science | 2008 | 8 Pages |
Abstract
We answer two questions of Allouche and Shallit regarding k-regular sequences and k-context-free sequences. One of these has been solved independently in another way by Bell. We also provide a partial solution to another question of Allouche and Shallit regarding the subword complexity of k-context-free sequences.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
