Seymour Ginsburg
- Seymour Ginsburg. On the
length of the smallest uniform experiment which distinguishes the
terminal states of a machine. Journal of the ACM,
5(3):266-280, July 1958.
Citations.
- Seymour Ginsburg. On the
reduction of superfluous states in a sequential machine.
Journal of the ACM, 6(2):259-282, April 1959.
Citations.
- Seymour Ginsburg. Connective properties preserved in
minimal state machines. Journal of the ACM,
7(4):311-325, October 1960.
References
and Citations.
- Seymour Ginsburg. Sets of
tapes accepted by different types of automata. Journal of the
ACM, 8(1):81-86, January 1961.
References.
- Seymour Ginsburg. Compatibility of states in
input-independent machines. Journal of the ACM,
8(3):400-403, July 1961.
References
and Citations.
- Seymour Ginsburg and H. Gordon Rice. Two families of languages related
to ALGOL. Journal of the ACM, 9(3):350-371, July 1962.
References
and Citations.
- Seymour Ginsburg and Gene F. Rose. Some recursively unsolvable
problems in ALGOL-like languages. Journal of the ACM,
10(1):29-47, January 1963.
References
and Citations.
- Seymour Ginsburg and G. F. Rose. Operations which preserve
definability in languages. Journal of the ACM,
10(2):175-195, April 1963.
References
and Citations.
- Seymour Ginsburg and Edwin H. Spanier. Quotients of context-free
languages. Journal of the ACM, 10(4):487-492, October
1963.
References
and Citations.
- 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.
References.
- Seymour Ginsburg and Edwin H. Spanier. Mappings of languages by two-tape
devices. Journal of the ACM, 12(3):423-434, July 1965.
References.
- Seymour Ginsburg and Joseph Ullian. Ambiguity in context free
languages. Journal of the ACM, 13(1):62-89, January
1966.
References
and Citations.
- 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.
References
and Citations.
- Seymour Ginsburg, Sheila A. Greibach, and Michael A. Harrison. Stack automata and
compiling. Journal of the ACM, 14(1):172-201, January
1967.
References
and Citations.
- Seymour Ginsburg, Sheila A. Greibach, and Michael A. Harrison. One-way stack automata.
Journal of the ACM, 14(2):389-418, April 1967.
References
and Citations.
- Seymour Ginsburg and Michael A. Harrison. One-way nondeterministic
real-time list-storage languages. Journal of the ACM,
15(3):428-446, July 1968.
References
and Citations.
- Seymour Ginsburg and John Hopcroft. Two-way balloon automata and
AFL. Journal of the ACM, 17(1):3-13, January 1970.
References,
etc.
- Sheila Greibach and Seymour Ginsburg. Multitape AFA. Journal
of the ACM, 19(2):193-221, April 1972.
References,
Citations,
etc.
- Armin Gabrielian and Seymour Ginsburg. Grammar schemata.
Journal of the ACM, 21(2):213-226, April 1974.
References,
etc.
- Seymour Ginsburg and Nancy Lynch. Size complexity in context-free
grammars forms. Journal of the ACM, 23(4):582-598,
October 1976.
- Seymour Ginsburg and Sami Mohammed Zaiddan. Properties of
functional-dependency families. Journal of the ACM,
29(3):678-698, July 1982.
Citations.
- Serge Abiteboul and Seymour Ginsburg. Tuple sequences and
lexicographic indexes. Journal of the ACM,
33(3):409-422, July 1986.
- Seymour Ginsburg and Richard Hull. Sort sets in the relational
model. Journal of the ACM, 33(3):465-488, July 1986.
Shortcuts: