arXiv:1102.1779 [math.CO]AbstractReferencesReviewsResources
From indexed grammars to generating functions
Jared Adam, Eric Freden, Marni Mishna
Published 2011-02-09, updated 2014-01-07Version 3
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.
Comments: 23 pages, 3 figures
Journal: RAIRO - Theor. Inf. and Applic. 47(4): 325-350 (2013)
DOI: 10.1051/ita/2013041
Keywords: generating functions, indexed grammars, larger class, growth series, unambiguous context-free language
Tags: journal article
Related articles: Most relevant | Search more
arXiv:math/0608398 [math.CO] (Published 2006-08-15)
Mixed powers of generating functions
arXiv:1607.06006 [math.CO] (Published 2016-07-20)
Restricted Stirling permutations
arXiv:0906.1836 [math.CO] (Published 2009-06-10)
Generating functions attached to some infinite matrices