A deterministic pushdown store automaton ~s superdetermm~suc if it is finite delay, and whenever two accessible configurations c~ and c~ in the same state and m reading mode are taken by the sameâ€¦ (More)

In this paper we consider how certain properties of monadic recursion schemes are related to those of cteterministic context-free languages. Previous work showed only how to translate properties ofâ€¦ (More)

The equivalence problem for languages accepted by deterministic pushdown automata is shown to be decidÂ able if and only if the strong equivalence problem for monadic recursion schemes is decidable.â€¦ (More)

A context-free language is said to be simple if it is accepted by a single-state deterministic pushdown store acceptor that operates in real-time and accepts by empty store. While the problem remainsâ€¦ (More)

A determinist? pushdown tor is called a simple machine when it is restricted 6~ have only on5t state, eperate in realand accept by empty store. While the existpnce of a~ effective procedure forâ€¦ (More)