Revision as of 18:19, 28 April 2021 edit Bender the Bot (talk \| contribs) Bots 1,064,377 edits m →References: HTTP → HTTPS for the American Mathematical Society, replaced: =http://www.ams.org/ → =https://www.ams.org/ Tag: AWB ← Previous edit		Revision as of 06:48, 20 June 2021 edit undo Lcdrovers (talk \| contribs) 366 edits add links to other formal language concepts in the introduction Next edit →
Line 1: In [[computer science]], the '''complexity function''' of a ''word'' or ''[[string, (computer science)\|string]]'' (a finite or infinite sequence of ~~letters~~symbols from some [[alphabet, (formal languages)\|alphabet]]) is the function that counts the number of distinct ''factors'' (substrings of consecutive symbols) ~~from~~of that string. More generally, the complexity function of a [[formal language,]] (a set of finite ~~words over an alphabet,~~strings) counts the number of distinct words of given length. ==Complexity function of a word==

Complexity function: Difference between revisions