From indexed grammars to generating functions
Combinatorics
2014-01-08 v3 Discrete Mathematics
Abstract
We extend the Chomsky/Sch\"utzenberger method of computing the growth series of an unambiguous context-free language to the larger class of indexed languages. We illustrate the technique with numerous examples.
Cite
@article{arxiv.1102.1779,
title = {From indexed grammars to generating functions},
author = {Jared Adam and Eric Freden and Marni Mishna},
journal= {arXiv preprint arXiv:1102.1779},
year = {2014}
}
Comments
23 pages, 3 figures