Generating functions for context-free languages

combinatorics generating-functions formal-languages context-free-grammar

Solution 1:

The classical Chomsky-Schutzenberger theorem is established in a constructive manner by transforming an unambiguous grammatical specification of the language into a set of polynomial equations.

According to Flajolet. He gives some nice examples where the construction from grammar to generating function is given. Flajolet, TCS 1987

Related

How to be a bird
Closure in the Space of Probability Measures with the Prohorov metric
Fundamental group of $\mathbb{R}^3$ \ finite number of lines passing through origin. [duplicate]
On Vanishing Riemann Sums and Odd Functions
If $\lambda_n \sim \mu_n$, is it true that $\sum \exp(-\lambda_n x) \sim \sum \exp(-\mu_n x)$ as $x \to 0$?
Definition of tamely ramified
How does one calculate the product of $\tan 1^{\circ} ... \tan 45^{\circ}?$
Derivative of a determinant
When does a vector field admit orthogonal fields?
Prime number generating function as product expansion
Closed unit ball is compact?
A series: $1-\frac{1}{2}-\frac{1}{3}-\frac{1}{4}+\frac{1}{5}-\frac{1}{6}+\frac{1}{7}+\cdots$