Theoretical Computer Science, 1985, Vol.39, pp.267-280
This paper is concerned with the computational power of two-way automata with more than one subrecursive storage medium. Two-way automata with a stack (a nonerasing stack or a pushdown store, respectively) and an arbitrary number of checking stacks are of special interest. They are able to accept exactly those sets which are elementary in the sense of Kalmár. If the number of checking stacks is fixed, then the computational power of the corresponding restricted classes of automata can also be characterized in terms of time and space complexity classes.
Computer Science ; Mathematics
View record in ScienceDirect (Access to full text may be restricted)
View full text in ScienceDirect