Source: wikibot/chomsky-schutzenberger-enumeration-theorem
= Chomsky–Schützenberger enumeration theorem
{wiki=Chomsky–Schützenberger_enumeration_theorem}
The Chomsky–Schützenberger enumeration theorem is a result in formal language theory that provides a way to count the number of strings of a given length that can be generated by a context-free grammar (CFG). Specifically, it deals with the enumeration of strings in relation to the derivations of the grammar.