Journal of the ACM Bibliography

Selected papers that cite this one

• Ronald V. Book and Sheila A. Greibach. Quasi-realtime languages -- extended abstract. In Conference Record of ACM Symposium on Theory of Computing, pages 15-18, Marina del Rey, California, 5-7 May 1969.

• Patrick C. Fischer, Albert R. Meyer, and Arnold L. Rosenberg. Real-time simulation of multihead tape units. Journal of the ACM, 19(4):590-607, October 1972.

• Seymour Ginsburg and Michael A. Harrison. One-way nondeterministic real-time list-storage languages. Journal of the ACM, 15(3):428-446, July 1968.

• Sheila A. Greibach. An infinite hierarchy of context-free languages. Journal of the ACM, 16(1):91-106, January 1969.

• Sheila A. Greibach. The hardest context-free language. SIAM Journal on Computing, 2(4):304-310, December 1973.

• Michael A. Harrison and Ivan M. Havel. Real-time strict deterministic languages. SIAM Journal on Computing, 1(4):333-349, December 1972.

• Cristopher Moore. Dynamical recognizers: real-time language recognition by analog computers. Theoretical Computer Science, 201(1-2):99-136, 6 July 1998.

• Kenneth W. Regan. Diagonalization, uniformity, and fixed-point theorems. Information and Computation, 98(1):1-40, May 1992.

• Arnold L. Rosenberg. On the independence of real-time definability and certain structural properties of context-free languages. Journal of the ACM, 15(4):672-679, October 1968.

• Paul M. B. Vitányi. On efficient simulations of multicounter machines. Information and Control, 55(1-3):20-39, October/November/December 1982.

Selected references

• Seymour Ginsburg and Edwin H. Spanier. Quotients of context-free languages. Journal of the ACM, 10(4):487-492, October 1963.

• Seymour Ginsburg and Joseph Ullian. Ambiguity in context free languages. Journal of the ACM, 13(1):62-89, January 1966.

• S.-Y. Kuroda. Classes of languages and linear-bounded automata. Information and Control, 7(2):207-223, June 1964.

Shortcuts: