Alternating Pushdown Automata (Preliminary Report)
暂无分享,去创建一个
[1] 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..
[2] Walter Lawrence Ruzzo. General context-free language recognition. , 1978 .
[3] Dexter Kozen,et al. On parallelism in turing machines , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).
[4] Oscar H. Ibarra,et al. Two-Way Pushdown Automata , 1967, Inf. Control..
[5] G. Markowsky,et al. On Dedekind’s problem: the number of isotone Boolean functions. II , 1975 .
[6] Stephen A. Cook,et al. Characterizations of Pushdown Machines in Terms of Time-Bounded Computers , 1971, J. ACM.
[7] Seymour Ginsburg,et al. Stack automata and compiling , 1967, JACM.
[8] Richard E. Ladner,et al. Propositional modal logic of programs , 1977, STOC '77.
[9] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.