Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
143 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

From indexed grammars to generating functions (1102.1779v3)

Published 9 Feb 2011 in math.CO and cs.DM

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.

Citations (2)

Summary

We haven't generated a summary for this paper yet.