2000 character limit reached
From indexed grammars to generating functions
Published 9 Feb 2011 in math.CO and cs.DM | (1102.1779v3)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.