So here's a sketch in an example-file for how to generate the Generating Functions Equations from a parser out of the parser internals. The resulting output should be easy to (re)format so that it fits into Maple, Singular or Sage for Gröbner basis solutions that then lead to explicit generating functions for the language of that parser.
These generating functions can then later be used to e.g. determine # valid strings of a certain length, or asymptotic growth of the language.
So here's a sketch in an example-file for how to generate the Generating Functions Equations from a parser out of the parser internals. The resulting output should be easy to (re)format so that it fits into Maple, Singular or Sage for Gröbner basis solutions that then lead to explicit generating functions for the language of that parser.
These generating functions can then later be used to e.g. determine # valid strings of a certain length, or asymptotic growth of the language.