%0 Journal Article
%T A Shrinking Lemma for Indexed Languages
%A Robert Gilman
%J Mathematics
%D 1995
%I arXiv
%X This article presents a combinatorial result on indexed languages which was inspired by an attempt to understand the structure of groups with indexed language word problem. We show that a sufficiently long word in an indexed language can be written as a product of a uniformly bounded number of terms in such a way that some proper subproduct belongs to the language.
%U http://arxiv.org/abs/math/9509205v1