Content deleted Content added
add red link to page on morse-hedlund theorem |
Adding short description: "Function that counts the number of distinct factors (substrings of consecutive symbols) in a string of symbols." |
||
Line 1:
{{Short description|Function that counts the number of distinct factors (substrings of consecutive symbols) in a string of symbols.}}
In [[computer science]], the '''complexity function''' of a ''word'' or ''[[string (computer science)|string]]'' (a finite or infinite sequence of symbols from some [[alphabet (formal languages)|alphabet]]) is the function that counts the number of distinct ''factors'' (substrings of consecutive symbols) of that string. More generally, the complexity function of a [[formal language]] (a set of finite strings) counts the number of distinct words of given length.
| |||