Multilevel Stack Automata

The author considers a sequence of classes of automata with memory that is an extension of stack memory, in such a way that the class of languages that are admissible by automata from the $i$-th class coincides with generalized indexed languages of level $i$.