Source: wikibot/parikh-s-theorem
= Parikh's theorem
{wiki=Parikh's_theorem}
Parikh's theorem is a result in formal language theory, particularly concerning context-free grammars and their relationship with the languages they generate. It asserts that for any context-free language, there exists a mapping that transforms the strings of the language into tuples representing the counts of each symbol in the string.