Iterated pushdown automata and complexity classes
暂无分享,去创建一个
[1] Seymour Ginsburg,et al. Stack automata and compiling , 1967, JACM.
[2] Seymour Ginsburg,et al. Algebraic and Automata Theoretic Properties of Formal Languages , 1975 .
[3] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[4] Richard J. Lipton,et al. Alternating Pushdown and Stack Automata , 1984, SIAM J. Comput..
[5] Rainer Parchmann,et al. On Deterministic Indexed Languages , 1980, Inf. Control..
[6] Alfred V. Aho,et al. Nested Stack Automata , 1969, Journal of the ACM.
[7] Werner Damm,et al. The IO- and OI-Hierarchies , 1982, Theor. Comput. Sci..
[8] 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..
[9] Sheila A. Greibach. Full AFLs and Nested Iterated Substitution , 1970, Inf. Control..
[10] Dana S. Scott. Some Definitional Suggestions for Automata Theory , 1967, J. Comput. Syst. Sci..
[11] Joost Engelfriet,et al. Simple Program Schemes and Formal Languages , 1974, Lecture Notes in Computer Science.
[12] Walter L. Ruzzo,et al. Tree-size bounded alternation(Extended Abstract) , 1979, J. Comput. Syst. Sci..
[13] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[14] Stephen A. Cook,et al. Characterizations of Pushdown Machines in Terms of Time-Bounded Computers , 1971, J. ACM.
[15] Daniel Leivant,et al. The Expressiveness of Simple and Second-Order Type Structures , 1983, JACM.
[16] Werner Damm,et al. An Automata-Theoretic Characterization of the OI-Hierarchy , 1982, ICALP.
[17] Jeffrey D. Ullman,et al. Nonerasing Stack Automata , 1967, J. Comput. Syst. Sci..
[18] Catriel Beeri,et al. Two-Way Nested Stack Automata Are Equivalent to Two-Way Stack Automata , 1975, J. Comput. Syst. Sci..