On subword complexity functions
The author finds a polynomial formula for the subword complexity function of a cyclic language. A characterization of context-free languages with exponential subword complexity is derived by appropriately using the pumping lemma.
scientific article; zbMATH DE number 3896327