default search action
Seymour Ginsburg
Person information
- affiliation: University of Southern California, Computer Science Department
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
1990 – 1999
- 1999
- [j87]Seymour Ginsburg, Nan C. Shu, Dan A. Simovici:
Automatic Data Restructuring. J. Univers. Comput. Sci. 5(4): 243-286 (1999) - 1998
- [j86]Seymour Ginsburg, Xiaoyang Sean Wang:
Regular Sequence Operations and Their Use in Database Queries. J. Comput. Syst. Sci. 56(1): 1-26 (1998) - 1995
- [j85]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) - [j84]Seymour Ginsburg, Katsumi Tanaka:
Interval Queries on Object Histories. Theor. Comput. Sci. 145(1&2): 291-316 (1995) - 1993
- [j83]Seymour Ginsburg, Dan A. Simovici, Xiaoyang Sean Wang:
Content-Related Interval Queries on Object Histories. Inf. Comput. 103(1): 30-67 (1993) - [p1]Seymour Ginsburg:
Object and Spreadsheet Histories. Temporal Databases 1993: 271-293 - 1992
- [c27]Seymour Ginsburg, Xiaoyang Sean Wang:
Pattern Matching by Rs-Operations: Toward a Unified Approach to Querying Sequenced Data. PODS 1992: 293-300 - 1991
- [j82]Guozhu Dong, Seymour Ginsburg:
Localizable Constraints for Object Histories. Theor. Comput. Sci. 90(2): 391-432 (1991) - 1990
- [j81]Seymour Ginsburg, Dan Tian:
Input-Dependent-Only Object Histories. J. Comput. Syst. Sci. 40(3): 346-375 (1990) - [j80]Guozhu Dong, Seymour Ginsburg:
On the Decomposition of Datalog Program Mappings. Theor. Comput. Sci. 76(1): 143-177 (1990)
1980 – 1989
- 1989
- [j79]Yongkyun Cho, Seymour Ginsburg:
Decision Problems of Object histories. Inf. Comput. 83(2): 245-263 (1989) - [j78]Seymour Ginsburg, Chang-jie Tang:
Cohesion of Object Histories. Theor. Comput. Sci. 63(1): 63-90 (1989) - 1988
- [c26]Seymour Ginsburg, Stephen Kurtzman:
Object-History and Spreadsheet P-Simulation. ICDT 1988: 383-395 - 1987
- [j77]Seymour Ginsburg, Marc Gyssens
:
Object Histories Which Avoid Certain Subsequences. Inf. Comput. 73(2): 174-206 (1987) - [j76]Seymour Ginsburg, Chang-jie Tang:
Canonical Forms for Interval Functions. Theor. Comput. Sci. 54: 299-313 (1987) - 1986
- [j75]Serge Abiteboul, Seymour Ginsburg:
Tuple sequences and lexicographic indexes. J. ACM 33(3): 409-422 (1986) - [j74]Seymour Ginsburg, Richard Hull:
Sort sets in the relational model. J. ACM 33(3): 465-488 (1986) - [j73]Seymour Ginsburg, Chang-jie Tang:
Projection of Object Histories. Theor. Comput. Sci. 48(3): 297-328 (1986) - [j72]Seymour Ginsburg, Katsumi Tanaka:
Computation-Tuple Sequences and Object Histories. ACM Trans. Database Syst. 11(2): 186-212 (1986) - [c25]Guozhu Dong, Seymour Ginsburg:
Localizable Constraints for Object Histories. XP7.52 Workshop on Database Theory 1986 - [c24]Seymour Ginsburg, Chang-jie Tang:
Cohesion of Object Histories. XP7.52 Workshop on Database Theory 1986 - 1985
- [j71]Seymour Ginsburg, Edwin H. Spanier:
On Completing Tables to Satisfy Functional Dependencies. Theor. Comput. Sci. 39: 309-317 (1985) - [c23]Seymour Ginsburg, Katsumi Tanaka:
Computation-Tuple Sequences and Object Histories: Extended Abstract. FODO 1985: 333-343 - [c22]Seymour Ginsburg, Chang-jie Tang:
Projection of Object Histories. FODO 1985: 345-358 - 1984
- [c21]Serge Abiteboul, Seymour Ginsburg:
Tuple Sequences and Indexes. ICALP 1984: 41-50 - [c20]Seymour Ginsburg, Katsumi Tanaka:
Interval Queries on Object Histories: Extended Abstract. VLDB 1984: 208-217 - 1983
- [j70]Seymour Ginsburg, Jonathan Goldstine, Edwin H. Spanier:
On the Equality of Grammatical Families. J. Comput. Syst. Sci. 26(2): 171-196 (1983) - [j69]Seymour Ginsburg, Richard Hull:
Order Dependency in the Relational Model. Theor. Comput. Sci. 26: 149-195 (1983) - [j68]Seymour Ginsburg, Richard Hull:
Characterizations for Functional Dependency and Boyce-CODD Normal Form Families. Theor. Comput. Sci. 26: 243-286 (1983) - [c19]Seymour Ginsburg, Richard Hull:
Sort Sets in the Relational Model. PODS 1983: 332-339 - 1982
- [j67]Seymour Ginsburg, Otto Mayer:
Tree acceptors and grammar forms. Computing 29(1): 1-9 (1982) - [j66]Seymour Ginsburg, Sami Mohammed Zaiddan:
Properties of functional-dependency families. J. ACM 29(3): 678-698 (1982) - [j65]Seymour Ginsburg, Jonathan Goldstine, Edwin H. Spanier:
A Prime Decomposition Theorem for Grammatical Families. J. Comput. Syst. Sci. 24(3): 315-361 (1982) - [j64]Meera Blattner, Seymour Ginsburg:
Position-Restricted Grammar Forms and Grammars. Theor. Comput. Sci. 17: 1-27 (1982) - 1981
- [j63]Seymour Ginsburg, Chandra M. R. Kintala:
Strict Interpretations of Deterministic Pushdown Acceptors. Math. Syst. Theory 14: 229-240 (1981) - [c18]Seymour Ginsburg, Richard Hull:
Characterization for Functional Dependency and Boyce-Codd Normal Form Databases. XP2 Workshop on Relational Database Theory 1981 - [c17]Seymour Ginsburg, Richard Hull:
Ordered Attribute Domains in the Relational Model. XP2 Workshop on Relational Database Theory 1981 - 1980
- [e2]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 [contents]
1970 – 1979
- 1979
- [j62]Seymour Ginsburg, Benton L. Leong, Otto Mayer, Detlef Wotschke:
On Strict Interpretations of Grammar Forms. Math. Syst. Theory 12: 233-252 (1979) - 1978
- [j61]Seymour Ginsburg, Derick Wood:
Precedence Relations in Grammar Forms. Acta Informatica 11: 79-88 (1978) - [j60]Seymour Ginsburg, Erica M. Rounds:
Dynamic Syntax Specification Using Grammar Forms. IEEE Trans. Software Eng. 4(1): 44-55 (1978) - 1977
- [j59]Seymour Ginsburg:
A survey of grammar forms - 1977. Acta Cybern. 3(4): 269-280 (1977) - [j58]Seymour Ginsburg, Hermann A. Maurer:
On quasi-interpretations of grammar forms. Computing 19(2): 141-147 (1977) - [j57]Armin B. Cremers, Seymour Ginsburg, Edwin H. Spanier:
The Structure of Context-Free Grammatical Families. J. Comput. Syst. Sci. 15(3): 262-279 (1977) - [j56]Seymour Ginsburg, Nancy A. Lynch:
Derivation Complexity in Context-Free Grammar Forms. SIAM J. Comput. 6(1): 123-138 (1977) - [j55]Seymour Ginsburg, Edwin H. Spanier:
Pushdown Acceptor Forms. Theor. Comput. Sci. 5(3): 307-320 (1977) - [c16]Meera Blattner, Seymour Ginsburg:
Canonical Forms of Context - Free Grammars and Position Restricted Grammar Forms. FCT 1977: 49-53 - 1976
- [j54]Seymour Ginsburg, Hermann A. Maurer:
On strongly equivalent context-free grammar forms. Computing 16(3): 281-290 (1976) - [j53]Seymour Ginsburg, Nancy A. Lynch:
Size complexity in context-free grammars forms. J. ACM 23(4): 582-598 (1976) - [j52]Seymour Ginsburg, Jonathan Goldstine, Sheila A. Greibach:
Some Uniformly Erasable Families of Languages. Theor. Comput. Sci. 2(1): 29-44 (1976) - [c15]Seymour Ginsburg, Otto Mayer:
On Strict Interpretations of Grammar Forms. MFCS 1976: 294-298 - 1975
- [j51]Seymour Ginsburg, Edwin H. Spanier:
Substitution of Grammar Forms. Acta Informatica 5: 377-386 (1975) - [j50]Seymour Ginsburg, Grzegorz Rozenberg:
TOL Schemes and Control Sets. Inf. Control. 27(2): 109-125 (1975) - [j49]Seymour Ginsburg, Jonathan Goldstine, Sheila A. Greibach:
Uniformly Erasable AFL. J. Comput. Syst. Sci. 10(2): 165-182 (1975) - [j48]Armin B. Cremers, Seymour Ginsburg:
Context-Free Grammar Forms. J. Comput. Syst. Sci. 11(1): 86-117 (1975) - [c14]Seymour Ginsburg, Nancy A. Lynch:
Comparative Complexity of Grammar Forms. STOC 1975: 153-158 - 1974
- [j47]Seymour Ginsburg, Branislav Rovan:
On the Periodicity of Word-Length in DOL Languages. Inf. Control. 26(1): 34-44 (1974) - [j46]Armen Gabrielian, Seymour Ginsburg:
Grammar Schemata. J. ACM 21(2): 213-226 (1974) - [j45]Seymour Ginsburg, Gene F. Rose:
The Equivalence of Stack Counter Acceptors and Quasi-Realtime Acceptors. J. Comput. Syst. Sci. 8(2): 243-269 (1974) - [j44]Seymour Ginsburg, Edwin H. Spanier:
On Incomparable Abstract Family of Languages (AFL). J. Comput. Syst. Sci. 9(1): 88-108 (1974) - [c13]Armin B. Cremers, Seymour Ginsburg:
Characterization of Context-Free Grammatical Families. SWAT 1974: 199-204 - [c12]Armin B. Cremers, Seymour Ginsburg:
Context-Free Grammar Forms. ICALP 1974: 364-382 - 1973
- [j43]Seymour Ginsburg, Jonathan Goldstine:
Intersection-Closed Full AFL and the Recursively Enumerable Languages. Inf. Control. 22(3): 201-231 (1973) - [j42]Seymour Ginsburg, Sheila A. Greibach:
On AFL Generators for Finitely Encoded AFA. J. Comput. Syst. Sci. 7(1): 1-27 (1973) - [j41]Armen Gabrielian, Seymour Ginsburg:
Structured Storage AFA. IEEE Trans. Computers 22(5): 534-537 (1973) - [c11]Seymour Ginsburg:
Substitution and (Semi-)AFL. MFCS 1973: 65-69 - 1972
- [j40]Seymour Ginsburg, Sheila A. Greibach:
Multitape AFA. J. ACM 19(2): 193-221 (1972) - [j39]Ronald V. Book, Seymour Ginsburg:
Multi-Stack-Counter Languages. Math. Syst. Theory 6(1): 37-48 (1972) - [j38]Seymour Ginsburg, Jonathan Goldstine:
On the Largest Full SubAFL of an AFL. Math. Syst. Theory 6(3): 241-242 (1972) - [c10]Armen Gabrielian, Seymour Ginsburg:
Structured-Storage AFA (Abstract). Formal Aspects of Cognitive Processes 1972: 70-71 - [c9]Sheila Carlyle-Greibach, Seymour Ginsburg, Jonathan Goldstine:
Uniformly Erasable AFL. STOC 1972: 207-213 - 1971
- [j37]Seymour Ginsburg, Edwin H. Spanier:
AFL with the Semilinear Property. J. Comput. Syst. Sci. 5(4): 365-396 (1971) - [j36]Seymour Ginsburg, John E. Hopcroft:
Images of AFL under Certain Families of Homomorphisms. Math. Syst. Theory 5(3): 216-227 (1971) - [c8]Seymour Ginsburg, Jonathan Goldstine:
Intersection-Closed full AFL and the Recursively Enumerable Languages. STOC 1971: 121-131 - 1970
- [j35]Seymour Ginsburg, Michael A. Harrison:
On the Closure of AFL under Reversal. Inf. Control. 17(4): 395-409 (1970) - [j34]Seymour Ginsburg, Edwin H. Spanier:
Substitution in families of languages. Inf. Sci. 2(1): 83-110 (1970) - [j33]Seymour Ginsburg, Gene F. Rose:
On the existence of generators for certain AFL. Inf. Sci. 2(4): 431-446 (1970) - [j32]Seymour Ginsburg, John E. Hopcroft:
Two-way balloon automata and AFL. J. ACM 17(1): 3-13 (1970) - [j31]Seymour Ginsburg, Sheila A. Greibach:
Principal AFL. J. Comput. Syst. Sci. 4(4): 308-338 (1970)
1960 – 1969
- 1969
- [j30]Seymour Ginsburg, Barbara Partee:
A Mathematical Model of Transformational Grammars. Inf. Control. 15(4): 297-334 (1969) - [e1]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 [contents] - 1968
- [j29]Seymour Ginsburg, Michael A. Harrison:
On the Elimination of Endmarkers. Inf. Control. 12(2): 103-115 (1968) - [j28]Seymour Ginsburg, Gene F. Rose:
A Note on Preservation of Languages by Transducers. Inf. Control. 12(5/6): 549-552 (1968) - [j27]Seymour Ginsburg, Michael A. Harrison:
One-way nondeterministic real-time list-storage languages. J. ACM 15(3): 428-446 (1968) - [j26]Seymour Ginsburg, Edwin H. Spanier:
Derivation-Bounded Languages. J. Comput. Syst. Sci. 2(3): 228-250 (1968) - [j25]Seymour Ginsburg, Edwin H. Spanier:
Control Sets on Grammars. Math. Syst. Theory 2(2): 159-177 (1968) - [c7]Seymour Ginsburg, John E. Hopcroft:
Two-Way Balloon Automata and AFL. SWAT 1968: 292-297 - [c6]Seymour Ginsburg, Edwin H. Spanier:
Derivation-Bounded Languages. SWAT 1968: 306-314 - 1967
- [j24]Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison:
Stack automata and compiling. J. ACM 14(1): 172-201 (1967) - [j23]Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison:
One-way stack automata. J. ACM 14(2): 389-418 (1967) - [j22]Seymour Ginsburg, Michael A. Harrison:
Bracketed Context-Free Languages. J. Comput. Syst. Sci. 1(1): 1-23 (1967) - [c5]Seymour Ginsburg, Sheila A. Greibach:
Abstract Families of Languages. SWAT 1967: 128-139 - 1966
- [j21]Seymour Ginsburg, Gene F. Rose:
Preservation of Languages by Transducers. Inf. Control. 9(2): 153-176 (1966) - [j20]Seymour Ginsburg, Sheila A. Greibach:
Mappings which Preserve Context Sensitive Languages. Inf. Control. 9(6): 563-582 (1966) - [j19]Seymour Ginsburg, Sheila A. Greibach:
Deterministic Context Free Languages. Inf. Control. 9(6): 620-648 (1966) - [j18]Seymour Ginsburg, Joseph S. Ullian:
Ambiguity in context free languages. J. ACM 13(1): 62-89 (1966) - [j17]Seymour Ginsburg, Joseph S. Ullian:
Preservation of unambiguity and inherent ambiguity in context-free languages. J. ACM 13(3): 364-368 (1966) - [c4]Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison:
One-Way Stack Automata (Extended Abstract). SWAT 1966: 47-52 - 1965
- [j16]Seymour Ginsburg, Edwin H. Spanier:
Mappings of languages by two-tape devices. J. ACM 12(3): 423-434 (1965) - [c3]Seymour Ginsburg, Sheila A. Greibach:
Deterministic context free languages. SWCT 1965: 203-220 - 1964
- [j15]Seymour Ginsburg, Thomas N. Hibbard:
Solvability of Machine Mappings of Regular Sets to Regular Sets. J. ACM 11(3): 302-312 (1964) - [c2]Seymour Ginsburg, Edwin H. Spanier:
Mappings of languages by two-tape devices. SWCT 1964: 57-67 - 1963
- [j14]Seymour Ginsburg, Gene F. Rose:
Some Recursively Unsolvable Problems in ALGOL-Like Languages. J. ACM 10(1): 29-47 (1963) - [j13]Seymour Ginsburg, Gene F. Rose:
Operations Which Preserve Definability in Languages. J. ACM 10(2): 175-195 (1963) - [j12]Seymour Ginsburg, Edwin H. Spanier:
Quotients of Context-Free Languages. J. ACM 10(4): 487-492 (1963) - 1962
- [j11]Seymour Ginsburg, H. Gordon Rice:
Two Families of Languages Related to ALGOL. J. ACM 9(3): 350-371 (1962) - [j10]Seymour Ginsburg:
Examples of Abstract Machines. IRE Trans. Electron. Comput. 11(2): 132-135 (1962) - 1961
- [j9]Seymour Ginsburg:
Theory of abstract machines. Commun. ACM 4(4): 195 (1961) - [j8]Seymour Ginsburg:
Sets of Tapes Accepted by Different Types of Automata. J. ACM 8(1): 81-86 (1961) - [j7]Seymour Ginsburg:
Compatibility of States in Input-Independent Machines. J. ACM 8(3): 400-403 (1961) - 1960
- [j6]Seymour Ginsburg:
Connective Properties Preserved in Minimal State Machines. J. ACM 7(4): 311-325 (1960)
1950 – 1959
- 1959
- [j5]Seymour Ginsburg:
On the Reduction of Superfluous States in a Sequential Machine. J. ACM 6(2): 259-282 (1959) - [j4]Seymour Ginsburg:
A Synthesis Technique for Minimal State Sequential Machines. IRE Trans. Electron. Comput. 8(1): 13-24 (1959) - [j3]Seymour Ginsburg:
A Technique for the Reduction of a Given Machine to a Minimal-State Machine. IRE Trans. Electron. Comput. 8(3): 346-355 (1959) - [j2]Seymour Ginsburg:
Synthesis of Minimal-State Machines. IRE Trans. Electron. Comput. 8(4): 441-449 (1959) - 1958
- [j1]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) - [c1]Seymour Ginsburg:
Some remarks on abstract machines. ACM National Meeting 1958: 2:1-2:3
Coauthor Index
Sheila A. Greibach
aka: Sheila Carlyle-Greibach
aka: Sheila Carlyle-Greibach
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: