Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. Book, R.V. (1975). Formal Language Theory and Theoretical Computer Science. Proceedings 2nd GI Conference, Automata Theory and Formal Languages, Kaiserslautern (1975), 1–16. Lecture Notes in Computer Science, No. 33.
2. Book, R.V. (1976). Translational Lemmas, Polynomial Time, and (log n)j-Space. Theoretical Computer Science 1 (1976), 215–226.
3. Cook, S.A. (1971). Characterizations of Pushdown Machines in Terms of Time-Bounded Computers. JACM 18 (1971), 4–18.
4. Hopcroft, J.E., Ullman, J.D. (1969 a). Formal Languages and their Relation to Automata. Addison-Wesley Publishing Company.
5. Hopcroft, J.E., Ullman, J.D. (1969 b). Some Results on Tape-Bounded Turing Machines. JACM 16 (1969), 168–177.
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献