On subword complexity functions (Q1057070)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On subword complexity functions |
scientific article |
Statements
On subword complexity functions (English)
0 references
1984
0 references
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.
0 references
subword complexity
0 references
cyclic language
0 references
context-free languages
0 references
0 references
