| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9505816 | Advances in Applied Mathematics | 2005 | 11 Pages |
Abstract
It is well known that the growth of a context-free language is either polynomial or exponential. However no algorithm for such an alternative is known. In this article we determine such an algorithm for the subclass of unambiguous linear languages.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Tullio Ceccherini-Silberstein,