Journal of the ACM Bibliography
I. H. Sudborough. On the
tape complexity of deterministic context-free languages. Journal
of the ACM, 25(3):405-414, July 1978.
[BibTeX entry]
Selected papers that cite this one
- Eric Allender, Jia Jiao, Meena Mahajan, and V. Vinay. Non-commutative
arithmetic circuits: depth reduction and size lower bounds.
Theoretical Computer Science, 209(1-2):47-86, 6 December
1998. Fundamental Study.
- E. Allender and K.-J. Lange. RUSPACE(log
n) \subseteq DSPACE(log^2 n/log log
n). Theory of Computing Systems,
31(5):539-550, September/October 1998.
- Dana Angluin and Michael Kharitonov. When won't membership
queries help? Journal of Computer and System Sciences,
50(2):336-355, April 1995.
- Allan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo, and
Martin Tompa. Two
applications of inductive counting for complementation problems.
SIAM Journal on Computing, 18(3):559-578, June 1989.
- Burchard von Braunmühl, Stephen Cook, Kurt Mehlhorn, and Rutger
Verbeek. The
recognition of deterministic CFL's in small time and space.
Information and Control, 56(1/2):34-51, January/February
1983.
- Gerhard Buntrock and Friedrich Otto. Growing context-sensitive languages
and Church-Rosser languages. Information and
Computation, 141(1):1-36, 25 February 1998.
- Anne Condon and Richard Ladner. Interactive proof
systems with polynomially bounded strategies. Journal of
Computer and System Sciences, 50(3):506-518, June 1995.
- J. Engelfriet, T. Harju, A. Proskurowski, and G. Rozenberg. Characterization
and complexity of uniformly nonprimitive labeled 2-structures.
Theoretical Computer Science, 154(2):247-282, 5 February
1996.
- Birgit Jenner, Pierre McKenzie, and Denis Thérien. Logspace and logtime leaf
languages. Information and Computation, 129(1):21-33,
25 August 1996.
- Changwook Kim and Dong Hoon Lee. Node replacement graph languages
squeezed with chains, trees, and forests. Information and
Computation, 117(1):63-77, 15 February 1995.
- I. I. Macarie. Multihead two-way
probabilistic finite automata. Theory of Computing
Systems, 30(1):91-109, January/February 1997.
- Ioan I. Macarie and Mitsunori Ogihara. Properties of
probabilistic pushdown automata. Theoretical Computer
Science, 207(1):117-130, 28 October 1998.
- Rolf Niedermeier and Peter Rossmanith. Unambiguous auxiliary pushdown
automata and semi-unbounded fan-in circuits. Information and
Computation, 118(2):227-245, 1 May 1995.
- Klaus Reinhardt and Eric Allender. Making nondeterminism
unambiguous. In 38th Annual Symposium on Foundations of
Computer Science, pages 244-253, Miami Beach, Florida, 20-22
October 1997. IEEE.
Shortcuts: