A Shrinking Lemma for Indexed Languages
Robert Gilman
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.
Create a lesson
Related papers
Invariant random subgroups of the finitary special linear group over a finite field
Noam Atar, Arie Levit
Vanishing-set inclusion and character degrees in finite p-groups
Zhi-Lin Zhang
Singular Loci of SL2(C)-Representation Varieties of Non-Hopfian Baumslag--Solitar Groups
S. Liriano
Finite groups with all involutions fused
Zheng Guo, Yan Zhou Zhu
A complete description of the algebraic structure of pseudocompact abelian groups
Dikran Dikranjan, Alejandro Dorantes-Aldama, Dmitri Shakhmatov
Constructing free subgroups of matrix groups
Emmanuel Breuillard, Bettina Eick, Tommy Hofmann et al.