Abstract

Abstract storage types can be concatenated in two ways. It is shown that the languages accepted by automata using concatenations of one–turn pushdowns can be characterized in terms of linear grammars with controlled derivations. These representations show that for one–turn pushdowns both ways of concatenating are equivalent. Furthermore, a relation to the hierarchy of Khabbaz is shown.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call