1995/09/11 by Robert H. Gilman, Gilman, Robert · 1 citation
Computer Science · #semigroups and automata theory #Algorithms and Data Compression #Computability, Logic, AI Algorithms
paper · pdf · doi:10.48550/arxiv.math/9509205
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.