On the growth of linear languages

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.