On Derivation Trees of Indexed Grammars – An Extension of the uvwxy-Theorem

Abstract

In this paper, the uvwxy-theorem of context-free languages is extended to the case of indexed languages. Applying the extended theorem, it is shown that the finiteness problem for the indexed languages is solvable and certain languages such as \{a^{n!} ∣ n ≥ 1\} and \{(\text{\textdollar}w)^{|w|}| w \in \{a, b\}^*\} are not indexed languages.