A Shrinking Lemma for Indexed Languages
Group Theory
2009-09-25 v1
Abstract
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.
Cite
@article{arxiv.math/9509205,
title = {A Shrinking Lemma for Indexed Languages},
author = {Robert Gilman},
journal= {arXiv preprint arXiv:math/9509205},
year = {2009}
}
Comments
DVI file, 6 pages