论文信息 - Two-Way Automata with More than one Storage Medium

Two-Way Automata with More than one Storage Medium

Abstract 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 Kalmar . 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.

Klaus W. Wagner | Jörg Vogel

[1] M. Minsky. Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines , 1961 .

[2] Stephen A. Cook,et al. Characterizations of Pushdown Machines in Terms of Time-Bounded Computers , 1971, J. ACM.

[3] Oscar H. Ibarra,et al. Two-Way Pushdown Automata , 1967, Inf. Control..

[4] Oscar H. Ibarra,et al. Characterizations of Some Tape and Time Complexity Classes of Turing Machines in Terms of Multihead and Auxiliary Stack Automata , 1971, J. Comput. Syst. Sci..

[5] Alfred V. Aho,et al. Time and Tape Complexity of Pushdown Automaton Languages , 1968, Inf. Control..

[6] Robert W. Ritchie,et al. CLASSES OF PREDICTABLY COMPUTABLE FUNCTIONS , 1963 .

[7] Jeffrey D. Ullman,et al. Nonerasing Stack Automata , 1967, J. Comput. Syst. Sci..

[8] Martin Davis. Review: Marvin L. Minsky, Recursive Unsolvability of Post's Problem of "Tag" and other Topics in the Theory of Turing Machines , 1966 .