LINEAR ITERATED PUSHDOWNS
David James Weir · Computational Intelligence · 1994
This paper discusses variants of nondeterministic one‐way S‐automata and context‐free S‐grammars where S is a storage type. The framework that these systems provide can be used to give alternative formulations of embedded pushdown automata and linear indexed grammars. The embedded pushdown automata is obtained by means of a linear version of a class of storage types called iterated pushdowns. Linear indexed grammar is obtained by using the pushdown storage type and restricting the way in which the grammar uses its storage.