Journal of the ACM Bibliography

Additional Key Words and Phrases: automata theory, pushdown store automation, context-free language, finite-turn pushdown store, one-counter machine

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.

• Seymour Ginsburg, Jonathan Goldstine, and Sheila Greibach. Some uniformly erasable families of languages. Theoretical Computer Science, 2(1):29-44, June 1976.

• S. A. Greibach. One way finite visit automata. Theoretical Computer Science, 6(2):175-221, April 1978.

• Sheila Greibach and Seymour Ginsburg. Multitape AFA. Journal of the ACM, 19(2):193-221, April 1972.

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

Selected references

• Ranan B. Banerji. Phrase structure languages, finite machines, and channel capacity. Information and Control, 6(2):153-162, June 1963.

• Patrick C. Fischer. Turing machines with restricted memory access. Information and Control, 9(4):364-379, August 1966.

• Seymour Ginsburg and Sheila A. Greibach. Deterministic context free languages. Information and Control, 9(6):620-648, December 1966.

• Seymour Ginsburg, Sheila A. Greibach, and Michael A. Harrison. One-way stack automata. Journal of the ACM, 14(2):389-418, April 1967.

• Sheila A. Greibach. The unsolvability of the recognition of linear context-free languages. Journal of the ACM, 13(4):582-587, October 1966.

• Sheila A. Greibach. A new normal-form theorem for context-free phrase structure grammars. Journal of the ACM, 12(1):42-52, January 1965.

• Arnold L. Rosenberg. Real-time definable languages. Journal of the ACM, 14(4):645-662, October 1967.

Shortcuts: