  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.
