Journal of the ACM Bibliography

Selected papers that cite this one

• Seymour Ginsburg and Thomas N. Hibbard. Solvability of machine mappings of regular sets to regular sets. Journal of the ACM, 11(3):302-312, July 1964.

• Seymour Ginsburg and Michael A. Harrison. Bracketed context-free languages. Journal of Computer and System Sciences, 1(1):1-23, April 1967.

• 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. Preservation of unambiguity and inherent ambiguity in context-free languages. Journal of the ACM, 13(3):364-368, July 1966.

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

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

• L. H. Haines. Note on the complement of a (minimal) linear language. Information and Control, 7(3):307-314, September 1964.

• Thomas N. Hibbard. Context-limited grammars. Journal of the ACM, 21(3):446-453, July 1974.

Selected references

• Noam Chomsky. On certain formal properties of grammars. Information and Control, 2(2):137-167, June 1959.

• Noam Chomsky and George A. Miller. Finite state languages. Information and Control, 1(2):91-112, May 1958.

• Seymour Ginsburg and H. Gordon Rice. Two families of languages related to ALGOL. Journal of the ACM, 9(3):350-371, July 1962.

• Stephen Scheinberg. Note on the Boolean properties of context free languages. Information and Control, 3(4):372-375, December 1960.

Shortcuts: