Seymour Ginsburg

1928 - 2004

	1999
107		Seymour Ginsburg, Nan C. Shu, Dan A. Simovici: Automatic Data Restructuring. J. UCS 5(4): 243-286 (1999)
	1998
106		Seymour Ginsburg, Xiaoyang Sean Wang: Regular Sequence Operations and Their Use in Database Queries. J. Comput. Syst. Sci. 56(1): 1-26 (1998)
	1995
105		Guozhu Dong, Seymour Ginsburg: On Decompositions of Chain Datalog Programs into P (left-)linear 1-rule Components. J. Log. Program. 23(3): 203-236 (1995)
104		Seymour Ginsburg, Katsumi Tanaka: Interval Queries on Object Histories. Theor. Comput. Sci. 145(1&2): 291-316 (1995)
	1993
103		Seymour Ginsburg: Object and Spreadsheet Histories. Temporal Databases 1993: 271-293
102		Seymour Ginsburg, Dan A. Simovici, Xiaoyang Sean Wang: Content-Related Interval Queries on Object Histories Inf. Comput. 103(1): 30-67 (1993)
	1992
101		Seymour Ginsburg, Xiaoyang Sean Wang: Pattern Matching by Rs-Operations: Toward a Unified Approach to Querying Sequenced Data. PODS 1992: 293-300
	1991
100		Guozhu Dong, Seymour Ginsburg: Localizable Constraints for Object Histories. Theor. Comput. Sci. 90(2): 391-432 (1991)
	1990
99		Seymour Ginsburg, Dan Tian: Input-Dependent-Only Object Histories. J. Comput. Syst. Sci. 40(3): 346-375 (1990)
98		Guozhu Dong, Seymour Ginsburg: On the Decomposition of Datalog Program Mappings. Theor. Comput. Sci. 76(1): 143-177 (1990)
	1989
97		Yongkyun Cho, Seymour Ginsburg: Decision Problems of Object histories Inf. Comput. 83(2): 245-263 (1989)
96		Seymour Ginsburg, Chang-jie Tang: Cohesion of Object Histories. Theor. Comput. Sci. 63(1): 63-90 (1989)
	1988
95		Seymour Ginsburg, Stephen Kurtzman: Object-History and Spreadsheet P-Simulation. ICDT 1988: 383-395
	1987
94		Seymour Ginsburg, Marc Gyssens: Object Histories Which Avoid Certain Subsequences Inf. Comput. 73(2): 174-206 (1987)
93		Seymour Ginsburg, Chang-jie Tang: Canonical Forms for Interval Functions. Theor. Comput. Sci. 54: 299-313 (1987)
	1986
92		Seymour Ginsburg, Chang-jie Tang: Cohesion of Object Histories. XP7.52 Workshop on Database Theory 1986
91		Guozhu Dong, Seymour Ginsburg: Localizable Constraints for Object Histories. XP7.52 Workshop on Database Theory 1986
90		Seymour Ginsburg, Katsumi Tanaka: Computation-Tuple Sequences and Object Histories. ACM Trans. Database Syst. 11(2): 186-212 (1986)
89		Serge Abiteboul, Seymour Ginsburg: Tuple sequences and lexicographic indexes. J. ACM 33(3): 409-422 (1986)
88		Seymour Ginsburg, Richard Hull: Sort sets in the relational model. J. ACM 33(3): 465-488 (1986)
87		Seymour Ginsburg, Chang-jie Tang: Projection of Object Histories. Theor. Comput. Sci. 48(3): 297-328 (1986)
	1985
86		Seymour Ginsburg, Katsumi Tanaka: Computation-Tuple Sequences and Object Histories: Extended Abstract. FODO 1985: 333-343
85		Seymour Ginsburg, Chang-jie Tang: Projection of Object Histories. FODO 1985: 345-358
84		Seymour Ginsburg, Edwin H. Spanier: On Completing Tables to Satisfy Functional Dependencies. Theor. Comput. Sci. 39: 309-317 (1985)
	1984
83		Serge Abiteboul, Seymour Ginsburg: Tuple Sequences and Indexes. ICALP 1984: 41-50
82		Seymour Ginsburg, Katsumi Tanaka: Interval Queries on Object Histories: Extended Abstract. VLDB 1984: 208-217
	1983
81		Seymour Ginsburg, Richard Hull: Sort Sets in the Relational Model. PODS 1983: 332-339
80		Seymour Ginsburg, Jonathan Goldstine, Edwin H. Spanier: On the Equality of Grammatical Families. J. Comput. Syst. Sci. 26(2): 171-196 (1983)
79		Seymour Ginsburg, Richard Hull: Order Dependency in the Relational Model. Theor. Comput. Sci. 26: 149-195 (1983)
78		Seymour Ginsburg, Richard Hull: Characterizations for Functional Dependency and Boyce-CODD Normal Form Families. Theor. Comput. Sci. 26: 243-286 (1983)
	1982
77		Seymour Ginsburg, Sami Mohammed Zaiddan: Properties of functional-dependency families. J. ACM 29(3): 678-698 (1982)
76		Seymour Ginsburg, Jonathan Goldstine, Edwin H. Spanier: A Prime Decomposition Theorem for Grammatical Families. J. Comput. Syst. Sci. 24(3): 315-361 (1982)
75		Meera Blattner, Seymour Ginsburg: Position-Restricted Grammar Forms and Grammars. Theor. Comput. Sci. 17: 1-27 (1982)
	1981
74		Seymour Ginsburg, Richard Hull: Characterization for Functional Dependency and Boyce-Codd Normal Form Databases. XP2 Workshop on Relational Database Theory 1981
73		Seymour Ginsburg, Richard Hull: Ordered Attribute Domains in the Relational Model. XP2 Workshop on Relational Database Theory 1981
72		Seymour Ginsburg, Chandra M. R. Kintala: Strict Interpretations of Deterministic Pushdown Acceptors. Mathematical Systems Theory 14: 229-240 (1981)
	1980
71		Raymond E. Miller, Seymour Ginsburg, Walter A. Burkhard, Richard J. Lipton: Proceedings of the 12th Annual ACM Symposium on Theory of Computing, April 28-30, 1980, Los Angeles, California, USA ACM 1980
	1979
70		Seymour Ginsburg, Benton L. Leong, Otto Mayer, Detlef Wotschke: On Strict Interpretations of Grammar Forms. Mathematical Systems Theory 12: 233-252 (1979)
	1978
69		Seymour Ginsburg, Derick Wood: Precedence Relations in Grammar Forms. Acta Inf. 11: 79-88 (1978)
68		Seymour Ginsburg, Erica M. Rounds: Dynamic Syntax Specification Using Grammar Forms. IEEE Trans. Software Eng. 4(1): 44-55 (1978)
	1977
67		Meera Blattner, Seymour Ginsburg: Canonical Forms of Context - Free Grammars and Position Restricted Grammar Forms. FCT 1977: 49-53
66		Seymour Ginsburg: A survey of grammar forms - 1977. Acta Cybern. 3: 269-280 (1977)
65		Armin B. Cremers, Seymour Ginsburg, Edwin H. Spanier: The Structure of Context-Free Grammatical Families. J. Comput. Syst. Sci. 15(3): 262-279 (1977)
64		Seymour Ginsburg, Nancy A. Lynch: Derivation Complexity in Context-Free Grammar Forms. SIAM J. Comput. 6(1): 123-138 (1977)
63		Seymour Ginsburg, Edwin H. Spanier: Pushdown Acceptor Forms. Theor. Comput. Sci. 5(3): 307-320 (1977)
	1976
62		Seymour Ginsburg, Otto Mayer: On Strict Interpretations of Grammar Forms. MFCS 1976: 294-298
61		Seymour Ginsburg, Hermann A. Maurer: On strongly equivalent context-free grammar forms. Computing 16(3): 281-290 (1976)
60		Seymour Ginsburg, Nancy A. Lynch: Size complexity in context-free grammars forms. J. ACM 23(4): 582-598 (1976)
59		Seymour Ginsburg, Jonathan Goldstine, Sheila A. Greibach: Some Uniformly Erasable Families of Languages. Theor. Comput. Sci. 2(1): 29-44 (1976)
	1975
58		Seymour Ginsburg, Nancy A. Lynch: Comparative Complexity of Grammar Forms STOC 1975: 153-158
57		Seymour Ginsburg, Edwin H. Spanier: Substitution of Grammar Forms. Acta Inf. 5: 377-386 (1975)
56		Seymour Ginsburg, Grzegorz Rozenberg: TOL Schemes and Control Sets Information and Control 27(2): 109-125 (1975)
55		Seymour Ginsburg, Jonathan Goldstine, Sheila A. Greibach: Uniformly Erasable AFL. J. Comput. Syst. Sci. 10(2): 165-182 (1975)
54		Armin B. Cremers, Seymour Ginsburg: Context-Free Grammar Forms. J. Comput. Syst. Sci. 11(1): 86-117 (1975)
	1974
53		Armin B. Cremers, Seymour Ginsburg: Context-Free Grammar Forms. ICALP 1974: 364-382
52		Armin B. Cremers, Seymour Ginsburg: Characterization of Context-Free Grammatical Families SWAT (FOCS) 1974: 199-204
51		Seymour Ginsburg, Branislav Rovan: On the Periodicity of Word-Length in DOL Languages Information and Control 26(1): 34-44 (1974)
50		Armen Gabrielian, Seymour Ginsburg: Grammar Schemata. J. ACM 21(2): 213-226 (1974)
49		Seymour Ginsburg, Gene F. Rose: The Equivalence of Stack Counter Acceptors and Quasi-Realtime Acceptors. J. Comput. Syst. Sci. 8(2): 243-269 (1974)
48		Seymour Ginsburg, Edwin H. Spanier: On Incomparable Abstract Family of Languages (AFL). J. Comput. Syst. Sci. 9(1): 88-108 (1974)
	1973
47		Seymour Ginsburg: Substitution and (Semi-)AFL. MFCS 1973: 65-69
46		Seymour Ginsburg, Jonathan Goldstine: Intersection-Closed Full AFL and the Recursively Enumerable Languages Information and Control 22(3): 201-231 (1973)
45		Seymour Ginsburg, Sheila A. Greibach: On AFL Generators for Finitely Encoded AFA. J. Comput. Syst. Sci. 7(1): 1-27 (1973)
	1972
44		Armen Gabrielian, Seymour Ginsburg: Structured-Storage AFA (Abstract). Formal Aspects of Cognitive Processes 1972: 70-71
43		Sheila Carlyle-Greibach, Seymour Ginsburg, Jonathan Goldstine: Uniformly Erasable AFL STOC 1972: 207-213
42		Seymour Ginsburg, Sheila A. Greibach: Multitape AFA. J. ACM 19(2): 193-221 (1972)
41		Seymour Ginsburg, Jonathan Goldstine: On the Largest Full SubAFL of an AFL. Mathematical Systems Theory 6(3): 241-242 (1972)
	1971
40		Seymour Ginsburg, Jonathan Goldstine: Intersection-Closed full AFL and the Recursively Enumerable Languages STOC 1971: 121-131
39		Seymour Ginsburg, Edwin H. Spanier: AFL with the Semilinear Property. J. Comput. Syst. Sci. 5(4): 365-396 (1971)
38		Seymour Ginsburg, John E. Hopcroft: Images of AFL under Certain Families of Homomorphisms. Mathematical Systems Theory 5(3): 216-227 (1971)
	1970
37		Seymour Ginsburg, Gene F. Rose: On the existence of generators for certain AFL. Inf. Sci. 2(4): 431-446 (1970)
36		Seymour Ginsburg, Michael A. Harrison: On the Closure of AFL under Reversal Information and Control 17(4): 395-409 (1970)
35		Seymour Ginsburg, John E. Hopcroft: Two-way balloon automata and AFL. J. ACM 17(1): 3-13 (1970)
34		Seymour Ginsburg, Sheila A. Greibach: Principal AFL. J. Comput. Syst. Sci. 4(4): 308-338 (1970)
	1969
33		Patrick C. Fischer, Seymour Ginsburg, Michael A. Harrison: Proceedings of the 1st Annual ACM Symposium on Theory of Computing, May 5-7, 1969, Marina del Rey, CA, USA ACM 1969
32		Seymour Ginsburg, Barbara Partee: A Mathematical Model of Transformational Grammars Information and Control 15(4): 297-334 (1969)
	1968
31		Seymour Ginsburg, John E. Hopcroft: Two-Way Balloon Automata and AFL SWAT (FOCS) 1968: 292-297
30		Seymour Ginsburg, Edwin H. Spanier: Derivation-Bounded Languages SWAT (FOCS) 1968: 306-314
29		Seymour Ginsburg, Michael A. Harrison: On the Elimination of Endmarkers Information and Control 12(2): 103-115 (1968)
28		Seymour Ginsburg, Gene F. Rose: A Note on Preservation of Languages by Transducers Information and Control 12(5/6): 549-552 (1968)
27		Seymour Ginsburg, Michael A. Harrison: One-way nondeterministic real-time list-storage languages. J. ACM 15(3): 428-446 (1968)
26		Seymour Ginsburg, Edwin H. Spanier: Derivation-Bounded Languages. J. Comput. Syst. Sci. 2(3): 228-250 (1968)
25		Seymour Ginsburg, Edwin H. Spanier: Control Sets on Grammars. Mathematical Systems Theory 2(2): 159-177 (1968)
	1967
24		Seymour Ginsburg, Sheila A. Greibach: Abstract Families of Languages SWAT (FOCS) 1967: 128-139
23		Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison: Stack automata and compiling. J. ACM 14(1): 172-201 (1967)
22		Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison: One-way stack automata. J. ACM 14(2): 389-418 (1967)
21		Seymour Ginsburg, Michael A. Harrison: Bracketed Context-Free Languages. J. Comput. Syst. Sci. 1(1): 1-23 (1967)
	1966
20		Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison: One-Way Stack Automata (Extended Abstract) SWAT (FOCS) 1966: 47-52
19		Seymour Ginsburg, Gene F. Rose: Preservation of Languages by Transducers Information and Control 9(2): 153-176 (1966)
18		Seymour Ginsburg, Sheila A. Greibach: Mappings which Preserve Context Sensitive Languages Information and Control 9(6): 563-582 (1966)
17		Seymour Ginsburg, Sheila A. Greibach: Deterministic Context Free Languages Information and Control 9(6): 620-648 (1966)
16		Seymour Ginsburg, Joseph S. Ullian: Ambiguity in context free languages. J. ACM 13(1): 62-89 (1966)
15		Seymour Ginsburg, Joseph S. Ullian: Preservation of unambiguity and inherent ambiguity in context-free languages. J. ACM 13(3): 364-368 (1966)
	1965
14		Seymour Ginsburg, Sheila A. Greibach: Deterministic context free languages SWCT (FOCS) 1965: 203-220
13		Seymour Ginsburg, Edwin H. Spanier: Mappings of languages by two-tape devices. J. ACM 12(3): 423-434 (1965)
	1964
12		Seymour Ginsburg, Edwin H. Spanier: Mappings of languages by two-tape devices SWCT (FOCS) 1964: 57-67
11		Seymour Ginsburg, Thomas N. Hibbard: Solvability of Machine Mappings of Regular Sets to Regular Sets. J. ACM 11(3): 302-312 (1964)
	1963
10		Seymour Ginsburg, Gene F. Rose: Some Recursively Unsolvable Problems in ALGOL-Like Languages. J. ACM 10(1): 29-47 (1963)
9		Seymour Ginsburg, Gene F. Rose: Operations Which Preserve Definability in Languages. J. ACM 10(2): 175-195 (1963)
8		Seymour Ginsburg, Edwin H. Spanier: Quotients of Context-Free Languages. J. ACM 10(4): 487-492 (1963)
	1962
7		Seymour Ginsburg, H. Gordon Rice: Two Families of Languages Related to ALGOL. J. ACM 9(3): 350-371 (1962)
	1961
6		Seymour Ginsburg: Theory of abstract machines. Commun. ACM 4(4): 195 (1961)
5		Seymour Ginsburg: Sets of Tapes Accepted by Different Types of Automata. J. ACM 8(1): 81-86 (1961)
4		Seymour Ginsburg: Compatibility of States in Input-Independent Machines. J. ACM 8(3): 400-403 (1961)
	1960
3		Seymour Ginsburg: Connective Properties Preserved in Minimal State Machines. J. ACM 7(4): 311-325 (1960)
	1959
2		Seymour Ginsburg: On the Reduction of Superfluous States in a Sequential Machine. J. ACM 6(2): 259-282 (1959)
	1958
1		Seymour Ginsburg: On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine. J. ACM 5(3): 266-280 (1958)

Coauthor Index

1	Serge Abiteboul	[83] [89]
2	Meera Blattner	[67] [75]
3	Walter A. Burkhard	[71]
4	Sheila Carlyle-Greibach	[43]
5	Yongkyun Cho	[97]
6	Armin B. Cremers	[52] [53] [54] [65]
7	Guozhu Dong	[91] [98] [100] [105]
8	Patrick C. Fischer	[33]
9	Armen Gabrielian	[44] [50]
10	Jonathan Goldstine	[40] [41] [43] [46] [55] [59] [76] [80]
11	Sheila A. Greibach	[14] [17] [18] [20] [22] [23] [24] [34] [42] [45] [55] [59]
12	Marc Gyssens	[94]
13	Michael A. Harrison	[20] [21] [22] [23] [27] [29] [33] [36]
14	Thomas N. Hibbard	[11]
15	John E. Hopcroft	[31] [35] [38]
16	Richard Hull	[73] [74] [78] [79] [81] [88]
17	Chandra M. R. Kintala	[72]
18	Stephen Kurtzman	[95]
19	Benton L. Leong	[70]
20	Richard J. Lipton	[71]
21	Nancy A. Lynch	[58] [60] [64]
22	Hermann A. Maurer	[61]
23	Otto Mayer	[62] [70]
24	Raymond E. Miller	[71]
25	Barbara Partee	[32]
26	H. Gordon Rice	[7]
27	Gene F. Rose	[9] [10] [19] [28] [37] [49]
28	Erica M. Rounds	[68]
29	Branislav Rovan	[51]
30	Grzegorz Rozenberg	[56]
31	Nan C. Shu	[107]
32	Dan A. Simovici	[102] [107]
33	Edwin H. Spanier	[8] [12] [13] [25] [26] [30] [39] [48] [57] [63] [65] [76] [80] [84]
34	Katsumi Tanaka	[82] [86] [90] [104]
35	Changjie Tang (Chang-jie Tang)	[85] [87] [92] [93] [96]
36	Dan Tian	[99]
37	Joseph S. Ullian	[15] [16]
38	Xiaoyang Sean Wang	[101] [102] [106]
39	Derick Wood	[69]
40	Detlef Wotschke	[70]
41	Sami Mohammed Zaiddan	[77]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page