Content deleted Content added
Deltahedron (talk | contribs) complexity function of a language, cite Berthé & Rigo (2010) |
Deltahedron (talk | contribs) |
||
Line 16:
==Complexity function of a language==
The complexity function of a language is less constrained than that of a word. For example, it may be bounded but not eventually constant: the complexity function ''p'' of the [[regular language]] <math>a(bb)^*a</math> takes values 3 and 4 on odd and even ''n''≥2 respectively.<ref name=
==Related concepts==
| |||