| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 418840 | Discrete Applied Mathematics | 2009 | 7 Pages |
Abstract
We prove that factorial languages defined over non-trivial finite alphabets under some natural conditions have intermediate complexity functions, i.e., the number of words in such a language grows faster than any polynomial but slower than any exponential function.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Arseny M. Shur,