combstruct - Maple Programming Help

Home : Support : Online Help : Mathematics : Discrete Mathematics : Combinatorics : Combinatorial Structures : combstruct/gfeqns

combstruct

 gfeqns
 find the system of generating function equations associated with a grammar

 Calling Sequence gfeqns(spec, typ, var, tags)

Parameters

 spec - combinatorial specification typ - labeling type; 'labeled' or 'unlabeled' var - variable to use in the generating functions tags - (optional) list of lists; each list contains a variable tag followed by the Epsilon nonterminal name(s) associated with that tag

Description

 • The gfeqns function returns a list of the generating function equations which count the objects described in the specification.
 Each nonterminal has an associated equation which uses the nonterminal name as the name of the equation. For example, $A\left(z\right)$ would be the generating function for $A$. The equation is in terms of the other nonterminals.
 • If the objects are labeled, the exponential generating functions are produced. If the objects are unlabeled, ordinary generating functions are used.
 • Objects can be marked (tagged) by forming the product of the object with a named Epsilon and associating a tag with that Epsilon.
 If the tag is a variable name, the resulting generating function equations have an extra variable that marks that object. The same tag can be associated with more than one Epsilon name. The tag does not need to be a variable.
 • For information on how to write specifications, see combstruct and combstruct[specification]

Examples

 > $\mathrm{with}\left(\mathrm{combstruct}\right):$

An example of a labeled binary tree.

 > $\mathrm{tree}≔\left\{T=\mathrm{Union}\left(L,\mathrm{Prod}\left(N,T,T\right)\right),L=\mathrm{Atom},N=\mathrm{Atom}\right\}:$
 > $\mathrm{gfeqns}\left(\mathrm{tree},\mathrm{labeled},z\right)$
 $\left[{L}{}\left({z}\right){=}{z}{,}{N}{}\left({z}\right){=}{z}{,}{T}{}\left({z}\right){=}{z}{+}{z}{}{{T}{}\left({z}\right)}^{{2}}\right]$ (1)

Mark the leaf nodes of an unlabeled general tree.

 > $\mathrm{tree1}≔\left\{T=\mathrm{Union}\left(L,\mathrm{Prod}\left(N,\mathrm{Set}\left(T\right)\right)\right),L=\mathrm{Prod}\left(\mathrm{leaf},\mathrm{Atom}\right),\mathrm{leaf}=\mathrm{Ε},N=\mathrm{Atom}\right\}:$
 > $\mathrm{gfeqns}\left(\mathrm{tree1},\mathrm{unlabeled},z,\left[\left[u,\mathrm{leaf}\right]\right]\right)$
 $\left[{L}{}\left({z}{,}{u}\right){=}{u}{}{z}{,}{N}{}\left({z}{,}{u}\right){=}{z}{,}{T}{}\left({z}{,}{u}\right){=}{L}{}\left({z}{,}{u}\right){+}{z}{}{{ⅇ}}^{{\sum }_{{{j}}_{{1}}{=}{1}}^{{\mathrm{∞}}}\phantom{\rule[-0.0ex]{5.0px}{0.0ex}}\frac{{T}{}\left({{z}}^{{{j}}_{{1}}}{,}{{u}}^{{{j}}_{{1}}}\right)}{{{j}}_{{1}}}}{,}{\mathrm{leaf}}{}\left({z}{,}{u}\right){=}{u}\right]$ (2)

Associate the value 2 with the leaves in this labeled general tree.

 > $\mathrm{gfeqns}\left(\mathrm{tree1},\mathrm{labeled},z,\left[\left[2,\mathrm{leaf}\right]\right]\right)$
 $\left[{L}{}\left({z}\right){=}{2}{}{z}{,}{N}{}\left({z}\right){=}{z}{,}{T}{}\left({z}\right){=}{L}{}\left({z}\right){+}{z}{}{{ⅇ}}^{{T}{}\left({z}\right)}{,}{\mathrm{leaf}}{}\left({z}\right){=}{2}\right]$ (3)