Some modifications of auxiliary pushdown automata
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 25 (1991) no. 6, pp. 545-556. 
@article{ITA_1991__25_6_545_0,
     author = {Buntrock, G. and Drewes, F. and Lautemann, C. and Mossakowski, T.},
     title = {Some modifications of auxiliary pushdown automata},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {545--556},
     publisher = {EDP-Sciences},
     volume = {25},
     number = {6},
     year = {1991},
     mrnumber = {1145427},
     zbl = {0705.68051},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_1991__25_6_545_0/}
}
TY  - JOUR
AU  - Buntrock, G.
AU  - Drewes, F.
AU  - Lautemann, C.
AU  - Mossakowski, T.
TI  - Some modifications of auxiliary pushdown automata
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1991
SP  - 545
EP  - 556
VL  - 25
IS  - 6
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1991__25_6_545_0/
LA  - en
ID  - ITA_1991__25_6_545_0
ER  - 
%0 Journal Article
%A Buntrock, G.
%A Drewes, F.
%A Lautemann, C.
%A Mossakowski, T.
%T Some modifications of auxiliary pushdown automata
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1991
%P 545-556
%V 25
%N 6
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1991__25_6_545_0/
%G en
%F ITA_1991__25_6_545_0
Buntrock, G.; Drewes, F.; Lautemann, C.; Mossakowski, T. Some modifications of auxiliary pushdown automata. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 25 (1991) no. 6, pp. 545-556. http://archive.numdam.org/item/ITA_1991__25_6_545_0/

1. F.-J. Brandenburg, On One-Way Auxiliary Pushdown Automata, Proc. 3rd GI Conf., Lecture Notes in Comput. Sci., 1977, 48, pp. 132-144. | MR | Zbl

2. G. Buntrock, On the Robustness of the Polynomial Time Hierarchy, Technical report, No. 87-11, Technische Universität Berlin, 1987.

3. M. P. Chytil, Analysis of the Non-Context-Free Component of Formal Languages, Lecture Notes in Comput. Sci., 1976, 45, pp. 230-236. | Zbl

4. S. A. Cook, The Complexity of Theorem Proving Procedures. 3rd STOC, 1971, pp. 151-158. | Zbl

5. S. A. Cook, Characterizations of Pushdown Machines in Terms of Time-Bounded Computers, J. Assoc. Comput. Mach., 1971, 18, pp. 4-18. | MR | Zbl

6. J. Hartmanis and H. B. Hunt Iii, The LBA Problem and lts Importance in the Theory of Computing, S.I.A.M.-A.M.S. Proc., 1974, 7, pp. 1-26. | Zbl

7. J. Hartmanis, N. Immerman and S. Mahaney, One-Way Log-Tape Reductions, 19th F.O.C.S., 1978, pp. 65-71. | MR

8. J. Hartmanis and S. Mahaney, Languages Simultaneously Complete for One-Way and Two-Way Log-Tape Automata, S.I.A.M.J. Comput., 1981, 10, pp. 383-390. | MR | Zbl

9. J. E. Hopcroft and D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 1979. | MR | Zbl

10. N. Immerman, Nondeterministic Space is Closed Under Complement, S.I.A.M. J. Comput., 1988, 17, pp. 935-938. | MR | Zbl

11. S.-Y. Kuroda, Classes of Languages and Linear-Bounded Automata, Inform. and Contr., 1964, 7, pp. 207-223. | MR | Zbl

12. C. Lautemann, One Pushdown and a Small Tape. In K. W. WAGNER Ed., Dirk Siefkes zum 50. Geburtstag, Technische Universität Berlin/Universität Augsburg, 1988, pp. 42-47.

13. I. Niepel, Logarithmisch platzbeschränkte Komplexitätsklassen: Charakterisierungen und offene Fragen, Diplomarbeit, Universität Hamburg, 1987.

14. I. H. Sudborough, On the Tape Complexity of Deterministic Context-Free Languages, J. Assoc. Comput. Mach., 1987, 25, pp. 405-414. | MR | Zbl

15. R. Szelepcsényi, The Method of Forced Enumeration for Nondeterministic Automata, Acta Inform., 1988, 26, pp. 279-284. | MR | Zbl

16. K. W. Wagner and G. Wechsung, Computational Complexity, Reidel Verlag, Dordrecht, and V.E.B. Deutscher Verlag der Wissenschaften, Berlin, 1986. | MR | Zbl