solve the system of generating functions associated with a grammar
gfsolve(spec, typ, var, tags)
labeling type; 'labeled' or 'unlabeled'
variable to use in the generating functions
(optional) list of lists; each list contains a variable tag followed by the Epsilon nonterminal name(s) associated with that tag
The gfsolve function returns a set containing the generating functions which count the objects described in the specification.
Each nonterminal A, has an associated generating function A⁡z, found by solving the system of generating function equations associated with the specification. If it cannot solve the system, it returns FAIL.
For more information, see combstruct[gfeqns].
If the objects are labeled, 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 that object with a named Epsilon and associating a tag with that Epsilon. If the tag is a variable name, the resulting generating function has 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].
An example of a labeled binary tree.
tree ≔ T=Union⁡L,Prod⁡N,T,T,L=Atom,N=Atom:
Nonplane ternary trees. Mark the leaf nodes of an unlabeled general tree.
ternary_tree ≔ G=Union⁡Z,Prod⁡Z,Set⁡G,card=3,labeled:
Mark the leaf nodes of an labeled general tree.
tree1 ≔ T=Union⁡L,Prod⁡N,Set⁡T,L=Prod⁡leaf,Atom,leaf=Ε,N=Atom:
Download Help Document