A Shrinking Lemma for Indexed Languages

Details A Shrinking Lemma for Indexed Languages A Shrinking Lemma for Indexed Languages

1995-09-11

arxiv.org/abs/math/9509205v1

Mathematics

Group Theory

DVI file, 6 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Shrinking Lemma for Indexed Languages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Shrinking Lemma for Indexed Languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Shrinking Lemma for Indexed Languages will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-519964