Symbolic method (combinatorics): Difference between revisions

Revision as of 15:30, 30 July 2018

Revision as of 22:34, 13 August 2018

Line 278:

===Specification and specifiable classes===

The elementary constructions mentionnedmentioned above allow to define the notion of ''specification''. Those specification allow 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.