Symbolic method (combinatorics): Difference between revisions

Content deleted Content added
Undid revision 1169666895 by No one trusts barking pigeon (talk) note formatting: mathcal P is not the same as the OGF P
m fix grammar properly
Line 286:
 
===Specification and specifiable classes===
The elementary constructions mentioned above allow us to define the notion of ''specification''. This specification allowallows us to use a set of recursive equations, with multiple combinatorial classes.
 
Formally, a specification for a set of combinatorial classes <math>(\mathcal A_1,\dots,\mathcal A_r)</math> is a set of <math>r</math> equations <math>\mathcal A_i=\Phi_i(\mathcal A_1,\dots,\mathcal A_r)</math>, where <math>\Phi_i</math> is an expression, whose atoms are <math>\mathcal E,\mathcal Z</math> and the <math>\mathcal A_i</math>'s, and whose operators are the elementary constructions listed above.