Journal of the ACM Bibliography
I. H. Sudborough. A note on
tape-bounded complexity classes and linear context-free grammars.
Journal of the ACM, 22(4):499-500, October 1975.
[BibTeX entry]
Selected papers that cite this one
- S. A. Greibach. One way finite visit
automata. Theoretical Computer Science, 6(2):175-221,
April 1978.
- Oscar H. Ibarra, Sam M. Kim, and Louis E. Rosier. On space and time efficient TM
simulations of some restricted classes of PDA's. Information
and Control, 67(1-3):126-143, October/November/December 1985.
- 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.
- 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: