1985 |
15 | | Seymour Ginsburg,
Edwin H. Spanier:
On Completing Tables to Satisfy Functional Dependencies.
Theor. Comput. Sci. 39: 309-317 (1985) |
1983 |
14 | | Seymour Ginsburg,
Jonathan Goldstine,
Edwin H. Spanier:
On the Equality of Grammatical Families.
J. Comput. Syst. Sci. 26(2): 171-196 (1983) |
1982 |
13 | | Seymour Ginsburg,
Jonathan Goldstine,
Edwin H. Spanier:
A Prime Decomposition Theorem for Grammatical Families.
J. Comput. Syst. Sci. 24(3): 315-361 (1982) |
1977 |
12 | | Armin B. Cremers,
Seymour Ginsburg,
Edwin H. Spanier:
The Structure of Context-Free Grammatical Families.
J. Comput. Syst. Sci. 15(3): 262-279 (1977) |
11 | | Seymour Ginsburg,
Edwin H. Spanier:
Pushdown Acceptor Forms.
Theor. Comput. Sci. 5(3): 307-320 (1977) |
1975 |
10 | | Seymour Ginsburg,
Edwin H. Spanier:
Substitution of Grammar Forms
Acta Inf. 5: 377-386 (1975) |
1974 |
9 | | Seymour Ginsburg,
Edwin H. Spanier:
On Incomparable Abstract Family of Languages (AFL).
J. Comput. Syst. Sci. 9(1): 88-108 (1974) |
1971 |
8 | | Seymour Ginsburg,
Edwin H. Spanier:
AFL with the Semilinear Property.
J. Comput. Syst. Sci. 5(4): 365-396 (1971) |
1969 |
7 | | Robert M. Baer,
Edwin H. Spanier:
Referenced Automata and Metaregular Families.
J. Comput. Syst. Sci. 3(4): 423-446 (1969) |
1968 |
6 | | Seymour Ginsburg,
Edwin H. Spanier:
Derivation-Bounded Languages
FOCS 1968: 306-314 |
5 | | Seymour Ginsburg,
Edwin H. Spanier:
Derivation-Bounded Languages.
J. Comput. Syst. Sci. 2(3): 228-250 (1968) |
4 | | Seymour Ginsburg,
Edwin H. Spanier:
Control Sets on Grammars.
Mathematical Systems Theory 2(2): 159-177 (1968) |
1965 |
3 | EE | Seymour Ginsburg,
Edwin H. Spanier:
Mappings of languages by two-tape devices.
J. ACM 12(3): 423-434 (1965) |
1964 |
2 | | Seymour Ginsburg,
Edwin H. Spanier:
Mappings of languages by two-tape devices
FOCS 1964: 57-67 |
1963 |
1 | EE | Seymour Ginsburg,
Edwin H. Spanier:
Quotients of Context-Free Languages.
J. ACM 10(4): 487-492 (1963) |