A Shrinking Lemma for Indexed Languages
classification
🧮 math.GR
keywords
indexedlanguagelanguageswordarticleattemptbelongsbounded
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.