Reversal-Bounded Multi-Pushdown Machines: Extended Abstract
暂无分享,去创建一个
[1] Roland Vollmar,et al. Note on Tape Reversal Complexity of Languages , 1970, Inf. Control..
[2] Seymour Ginsburg,et al. Abstract Families of Languages , 1967, SWAT.
[3] Juris Hartmanis. Tape-Reversal Bounded Turing Machine Computations , 1968, J. Comput. Syst. Sci..
[4] Seymour Ginsburg,et al. Principal AFL , 1970, J. Comput. Syst. Sci..
[5] S. Ginsburg,et al. Finite-Turn Pushdown Automata , 1966 .
[6] Juris Hartmanis,et al. What makes Some Language Theory Problems Undecidable , 1970, J. Comput. Syst. Sci..
[7] Patrick C. Fischer. The Reduction of Tape Reversals for Off-Line One-Tape Turing Machines , 1968, J. Comput. Syst. Sci..
[8] R. Smullyan. Theory of formal systems , 1962 .
[9] Sheila A. Greibach,et al. Checking Automata and One-Way Stack Languages , 1969, J. Comput. Syst. Sci..
[10] Sheila A. Greibach,et al. An Infinite Hierarchy of Context-Free Languages , 1967, JACM.