This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Shur, Arseny M. 2013. Developments in Language Theory. Vol. 7907, Issue. , p. 445.
Published online by Cambridge University Press: 22 November 2008
We tackle the problem of studying which kind of functions can occur as complexity functions of formal languages of a certain type. We prove that an important narrow subclass of rational languages contains languages of polynomial complexity of any integer degree over any non-trivial alphabet.