Journal of the ACM Bibliography
Seymour Ginsburg and H. Gordon Rice. Two families of
languages related to ALGOL. Journal of the ACM,
9(3):350-371, July 1962.
[BibTeX entry]
Selected papers that cite this one
- Stephen L. Bloom and Zoltán Ésik. The equational logic of
fixed points. Theoretical Computer Science,
179(1-2):1-60, 1 June 1997. Tutorial.
- Bruno Courcelle. Basic notions of
universal algebra for language theory and graph grammars.
Theoretical Computer Science, 163(1-2):1-54, 30 August
1996. Tutorial.
- Philip Gilbert. On the
syntax of algorithmic languages. Journal of the ACM,
13(1):90-107, January 1966.
- 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 G. F. Rose. Operations which preserve
definability in languages. Journal of the ACM,
10(2):175-195, April 1963.
- Seymour Ginsburg and Gene F. Rose. Some recursively unsolvable
problems in ALGOL-like languages. Journal of the ACM,
10(1):29-47, January 1963.
- Seymour Ginsburg and Edwin H. Spanier. Quotients of context-free
languages. Journal of the ACM, 10(4):487-492, October
1963.
- Seymour Ginsburg and Edwin H. Spanier. Mappings of languages by two-tape
devices. Journal of the ACM, 12(3):423-434, July 1965.
- Seymour Ginsburg and Joseph Ullian. Ambiguity in context free
languages. Journal of the ACM, 13(1):62-89, January
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.
- Kojiro Kobayashi and Shigeru Sekiguchi. On the class of predicates
decidable by two-way multitape finite automata. Journal of the
ACM, 13(2):236-261, April 1966.
- Daniel J. Rosenkrantz. Matrix equations and normal
forms for context-free grammars. Journal of the ACM,
14(3):501-507, July 1967.
- Donald F. Stanat. Approximation of weighted type
Information and Control, 21(4):344-381, November 1972.
- James W. Thatcher. Transformations and
translations from the point of view of generalized finite automata
theory. In Conference Record of ACM Symposium on Theory of
Computing, pages 129-142, Marina del Rey, California, 5-7 May
1969.
Selected references
Shortcuts: