| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 434891 | Theoretical Computer Science | 2012 | 8 Pages |
Abstract
We introduce a large family of k-context-free sequences for which we give a polynomial upper bound on their complexity functions.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
