| |
| 1974 | ||
|---|---|---|
| 10 | Seymour Ginsburg, Gene F. Rose: The Equivalence of Stack Counter Acceptors and Quasi-Realtime Acceptors. J. Comput. Syst. Sci. 8(2): 243-269 (1974) | |
| 1970 | ||
| 9 | EE | Seymour Ginsburg, Gene F. Rose: On the existence of generators for certain AFL. Inf. Sci. 2(4): 431-446 (1970) |
| 8 | Gene F. Rose: Abstract Families of Processors. J. Comput. Syst. Sci. 4(3): 193-204 (1970) | |
| 1969 | ||
| 7 | Gene F. Rose: Abstract Families of Processors STOC 1969: 9-14 | |
| 1968 | ||
| 6 | Seymour Ginsburg, Gene F. Rose: A Note on Preservation of Languages by Transducers Information and Control 12(5/6): 549-552 (1968) | |
| 5 | Gene F. Rose: Closures which Preserve Finiteness in Families of Languages. J. Comput. Syst. Sci. 2(2): 148-168 (1968) | |
| 1966 | ||
| 4 | Seymour Ginsburg, Gene F. Rose: Preservation of Languages by Transducers Information and Control 9(2): 153-176 (1966) | |
| 1964 | ||
| 3 | EE | Gene F. Rose: An extension of ALGOL-like languages. Commun. ACM 7(2): 52-61 (1964) |
| 1963 | ||
| 2 | EE | Seymour Ginsburg, Gene F. Rose: Some Recursively Unsolvable Problems in ALGOL-Like Languages. J. ACM 10(1): 29-47 (1963) |
| 1 | EE | Seymour Ginsburg, Gene F. Rose: Operations Which Preserve Definability in Languages. J. ACM 10(2): 175-195 (1963) |
| 1 | Seymour Ginsburg | [1] [2] [4] [6] [9] [10] |