Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science
Reference27 articles.
1. A. V. Aho, J. E. Hopcroft andJ. D. Ullman, Time and tape complexity of pushdown automaton languages,Information and Conrol 13 (1968), 186–206.
2. R. V. Book, On languages accepted in polynomial time,SIAM J. Computing 1 (1972), 281–287.
3. S. A. Cook, The complexity of theorem proving procedures,Proceedings of 3rd Annual ACM Symposium of Theory of Computing, (1971), 151–158.
4. S. A. Cook, Characterization of pushdown machines in terms of time-bounded computers,JACM 18 (1971), 4–18.
5. S. A. Cook, Linear time simulation of deterministic two-way pushdown automata,Proceedings IFIP Congress 71, TA-2, North Holland, Amsterdam (1971), 172–179.
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献