Generalizations of Checking Stack Automata: Characterizations and Hierarchies
暂无分享,去创建一个
[1] M. Minsky. Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines , 1961 .
[2] Klaus W. Wagner,et al. Two-Way Automata with More than one Storage Medium , 1985, Theor. Comput. Sci..
[3] Stephen A. Cook,et al. Characterizations of Pushdown Machines in Terms of Time-Bounded Computers , 1971, J. ACM.
[4] Seymour Ginsburg,et al. One-way stack automata , 1967, JACM.
[5] Oscar H. Ibarra,et al. Generalizations of Checking Stack Automata: Characterizations and Hierarchies , 2018, DLT.
[6] Burkhard Monien. Two-Way Multihead Automata Over a One-Letter Alphabet , 1980, RAIRO Theor. Informatics Appl..
[7] Seymour Ginsburg,et al. Stack automata and compiling , 1967, JACM.
[8] Oscar H. Ibarra,et al. Space Complexity of Stack Automata Models , 2020, DLT.
[9] K. N. King,et al. Stack Languages and log n Space , 1978, J. Comput. Syst. Sci..
[10] Oscar H. Ibarra,et al. Variations of Checking Stack Automata: Obtaining Unexpected Decidability Properties , 2018, Theor. Comput. Sci..
[11] Joost Engelfriet. The Power to Two-Way Deterministic Checking Stack Automata , 1989, Inf. Comput..
[12] Oscar H. Ibarra. A Note Concerning Nondeterministic Tape Complexities , 1972, JACM.
[13] Catriel Beeri,et al. Checking Stacks and Context-Free Programmed Grammars Accept p-complete Languages , 1974 .