Seymour Ginsburg

117 papers A* 10A 1B 3Journal 87Unranked 15
YearRankTypeTitle / Venue / Authors
1999 J jnl
Automatic Data Restructuring.
J. Univers. Comput. Sci.
Seymour Ginsburg, Nan C. Shu, Dan A. Simovici
1998 J jnl
Regular Sequence Operations and Their Use in Database Queries.
J. Comput. Syst. Sci.
Seymour Ginsburg, Xiaoyang Sean Wang
1995 J jnl
Interval Queries on Object Histories.
Theor. Comput. Sci.
Seymour Ginsburg, Katsumi Tanaka
1995 J jnl
On Decompositions of Chain Datalog Programs into
J. Log. Program.
Guozhu Dong, Seymour Ginsburg
1993 J jnl
Content-Related Interval Queries on Object Histories
Inf. Comput.
Seymour Ginsburg, Dan A. Simovici, Xiaoyang Sean Wang
1993 — ch.
Object and Spreadsheet Histories.
Temporal Databases
Seymour Ginsburg
1992 A* conf
Pattern Matching by Rs-Operations: Toward a Unified Approach to Querying Sequenced Data.
PODS
Seymour Ginsburg, Xiaoyang Sean Wang
1991 J jnl
Localizable Constraints for Object Histories.
Theor. Comput. Sci.
Guozhu Dong, Seymour Ginsburg
1990 J jnl
Input-Dependent-Only Object Histories.
J. Comput. Syst. Sci.
Seymour Ginsburg, Dan Tian
1990 J jnl
On the Decomposition of Datalog Program Mappings.
Theor. Comput. Sci.
Guozhu Dong, Seymour Ginsburg
1989 J jnl
Cohesion of Object Histories.
Theor. Comput. Sci.
Seymour Ginsburg, Chang-jie Tang
1989 J jnl
Decision Problems of Object histories
Inf. Comput.
Yongkyun Cho, Seymour Ginsburg
1988 A conf
Object-History and Spreadsheet P-Simulation.
ICDT
Seymour Ginsburg, Stephen Kurtzman
1987 J jnl
Canonical Forms for Interval Functions.
Theor. Comput. Sci.
Seymour Ginsburg, Chang-jie Tang
1987 J jnl
Object Histories Which Avoid Certain Subsequences
Inf. Comput.
Seymour Ginsburg, Marc Gyssens
1986 — conf
Cohesion of Object Histories.
XP7.52 Workshop on Database Theory
Seymour Ginsburg, Chang-jie Tang
1986 J jnl
Computation-Tuple Sequences and Object Histories.
ACM Trans. Database Syst.
Seymour Ginsburg, Katsumi Tanaka
1986 — conf
Localizable Constraints for Object Histories.
XP7.52 Workshop on Database Theory
Guozhu Dong, Seymour Ginsburg
1986 J jnl
Projection of Object Histories.
Theor. Comput. Sci.
Seymour Ginsburg, Chang-jie Tang
1986 J jnl
Sort sets in the relational model.
J. ACM
Seymour Ginsburg, Richard Hull
1986 J jnl
Tuple sequences and lexicographic indexes.
J. ACM
Serge Abiteboul, Seymour Ginsburg
1985 — conf
Computation-Tuple Sequences and Object Histories: Extended Abstract.
FODO
Seymour Ginsburg, Katsumi Tanaka
1985 J jnl
On Completing Tables to Satisfy Functional Dependencies.
Theor. Comput. Sci.
Seymour Ginsburg, Edwin H. Spanier
1985 — conf
Projection of Object Histories.
FODO
Seymour Ginsburg, Chang-jie Tang
1984 A* conf
Interval Queries on Object Histories: Extended Abstract.
VLDB
Seymour Ginsburg, Katsumi Tanaka
1984 A* conf
Tuple Sequences and Indexes.
ICALP
Serge Abiteboul, Seymour Ginsburg
1983 J jnl
Characterizations for Functional Dependency and Boyce-CODD Normal Form Families.
Theor. Comput. Sci.
Seymour Ginsburg, Richard Hull
1983 J jnl
On the Equality of Grammatical Families.
J. Comput. Syst. Sci.
Seymour Ginsburg, Jonathan Goldstine, Edwin H. Spanier
1983 J jnl
Order Dependency in the Relational Model.
Theor. Comput. Sci.
Seymour Ginsburg, Richard Hull
1983 A* conf
Sort Sets in the Relational Model.
PODS
Seymour Ginsburg, Richard Hull
1982 J jnl
A Prime Decomposition Theorem for Grammatical Families.
J. Comput. Syst. Sci.
Seymour Ginsburg, Jonathan Goldstine, Edwin H. Spanier
1982 J jnl
Position-Restricted Grammar Forms and Grammars.
Theor. Comput. Sci.
Meera Blattner, Seymour Ginsburg
1982 J jnl
Properties of functional-dependency families.
J. ACM
Seymour Ginsburg, Sami Mohammed Zaiddan
1982 J jnl
Tree acceptors and grammar forms.
Computing
Seymour Ginsburg, Otto Mayer
1981 — conf
Characterization for Functional Dependency and Boyce-Codd Normal Form Databases.
XP2 Workshop on Relational Database Theory
Seymour Ginsburg, Richard Hull
1981 — conf
Ordered Attribute Domains in the Relational Model.
XP2 Workshop on Relational Database Theory
Seymour Ginsburg, Richard Hull
1981 J jnl
Strict Interpretations of Deterministic Pushdown Acceptors.
Math. Syst. Theory
Seymour Ginsburg, Chandra M. R. Kintala
1980 A* ed.
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, April 28-30, 1980, Los Angeles, California, USA
STOC
Raymond E. Miller, Seymour Ginsburg, Walter A. Burkhard, Richard J. Lipton
1979 J jnl
On Strict Interpretations of Grammar Forms.
Math. Syst. Theory
Seymour Ginsburg, Benton L. Leong, Otto Mayer, Detlef Wotschke
1978 J jnl
Dynamic Syntax Specification Using Grammar Forms.
IEEE Trans. Software Eng.
Seymour Ginsburg, Erica M. Rounds
1978 J jnl
Precedence Relations in Grammar Forms.
Acta Informatica
Seymour Ginsburg, Derick Wood
1977 J jnl
A survey of grammar forms - 1977.
Acta Cybern.
Seymour Ginsburg
1977 B conf
Canonical Forms of Context - Free Grammars and Position Restricted Grammar Forms.
FCT
Meera Blattner, Seymour Ginsburg
1977 J jnl
Derivation Complexity in Context-Free Grammar Forms.
SIAM J. Comput.
Seymour Ginsburg, Nancy A. Lynch
1977 J jnl
On quasi-interpretations of grammar forms.
Computing
Seymour Ginsburg, Hermann A. Maurer
1977 J jnl
Pushdown Acceptor Forms.
Theor. Comput. Sci.
Seymour Ginsburg, Edwin H. Spanier
1977 J jnl
The Structure of Context-Free Grammatical Families.
J. Comput. Syst. Sci.
Armin B. Cremers, Seymour Ginsburg, Edwin H. Spanier
1976 B conf
On Strict Interpretations of Grammar Forms.
MFCS
Seymour Ginsburg, Otto Mayer
1976 J jnl
On strongly equivalent context-free grammar forms.
Computing
Seymour Ginsburg, Hermann A. Maurer
1976 J jnl
Size complexity in context-free grammars forms.
J. ACM
Seymour Ginsburg, Nancy A. Lynch
1976 J jnl
Some Uniformly Erasable Families of Languages.
Theor. Comput. Sci.
Seymour Ginsburg, Jonathan Goldstine, Sheila A. Greibach
1975 A* conf
Comparative Complexity of Grammar Forms
STOC
Seymour Ginsburg, Nancy A. Lynch
1975 J jnl
Context-Free Grammar Forms.
J. Comput. Syst. Sci.
Armin B. Cremers, Seymour Ginsburg
1975 J jnl
Substitution of Grammar Forms.
Acta Informatica
Seymour Ginsburg, Edwin H. Spanier
1975 J jnl
TOL Schemes and Control Sets
Inf. Control.
Seymour Ginsburg, Grzegorz Rozenberg
1975 J jnl
Uniformly Erasable AFL.
J. Comput. Syst. Sci.
Seymour Ginsburg, Jonathan Goldstine, Sheila A. Greibach
1974 — conf
Characterization of Context-Free Grammatical Families
SWAT
Armin B. Cremers, Seymour Ginsburg
1974 A* conf
Context-Free Grammar Forms.
ICALP
Armin B. Cremers, Seymour Ginsburg
1974 J jnl
Grammar Schemata.
J. ACM
Armen Gabrielian, Seymour Ginsburg
1974 J jnl
On Incomparable Abstract Family of Languages (AFL).
J. Comput. Syst. Sci.
Seymour Ginsburg, Edwin H. Spanier
1974 J jnl
On the Periodicity of Word-Length in DOL Languages
Inf. Control.
Seymour Ginsburg, Branislav Rovan
1974 J jnl
The Equivalence of Stack Counter Acceptors and Quasi-Realtime Acceptors.
J. Comput. Syst. Sci.
Seymour Ginsburg, Gene F. Rose
1973 J jnl
Intersection-Closed Full AFL and the Recursively Enumerable Languages
Inf. Control.
Seymour Ginsburg, Jonathan Goldstine
1973 J jnl
On AFL Generators for Finitely Encoded AFA.
J. Comput. Syst. Sci.
Seymour Ginsburg, Sheila A. Greibach
1973 J jnl
Structured Storage AFA.
IEEE Trans. Computers
Armen Gabrielian, Seymour Ginsburg
1973 B conf
Substitution and (Semi-)AFL.
MFCS
Seymour Ginsburg
1972 J jnl
Multi-Stack-Counter Languages.
Math. Syst. Theory
Ronald V. Book, Seymour Ginsburg
1972 J jnl
Multitape AFA.
J. ACM
Seymour Ginsburg, Sheila A. Greibach
1972 J jnl
On the Largest Full SubAFL of an AFL.
Math. Syst. Theory
Seymour Ginsburg, Jonathan Goldstine
1972 — conf
Structured-Storage AFA (Abstract).
Formal Aspects of Cognitive Processes
Armen Gabrielian, Seymour Ginsburg
1972 A* conf
Uniformly Erasable AFL
STOC
Sheila Carlyle-Greibach, Seymour Ginsburg, Jonathan Goldstine
1971 J jnl
AFL with the Semilinear Property.
J. Comput. Syst. Sci.
Seymour Ginsburg, Edwin H. Spanier
1971 J jnl
Images of AFL under Certain Families of Homomorphisms.
Math. Syst. Theory
Seymour Ginsburg, John E. Hopcroft
1971 A* conf
Intersection-Closed full AFL and the Recursively Enumerable Languages
STOC
Seymour Ginsburg, Jonathan Goldstine
1970 J jnl
On the Closure of AFL under Reversal
Inf. Control.
Seymour Ginsburg, Michael A. Harrison
1970 J jnl
On the existence of generators for certain AFL.
Inf. Sci.
Seymour Ginsburg, Gene F. Rose
1970 J jnl
Principal AFL.
J. Comput. Syst. Sci.
Seymour Ginsburg, Sheila A. Greibach
1970 J jnl
Substitution in families of languages.
Inf. Sci.
Seymour Ginsburg, Edwin H. Spanier
1970 J jnl
Two-way balloon automata and AFL.
J. ACM
Seymour Ginsburg, John E. Hopcroft
1969 J jnl
A Mathematical Model of Transformational Grammars
Inf. Control.
Seymour Ginsburg, Barbara Partee
1969 A* ed.
Proceedings of the 1st Annual ACM Symposium on Theory of Computing, May 5-7, 1969, Marina del Rey, CA, USA
STOC
Patrick C. Fischer, Seymour Ginsburg, Michael A. Harrison
1968 J jnl
A Note on Preservation of Languages by Transducers
Inf. Control.
Seymour Ginsburg, Gene F. Rose
1968 J jnl
Control Sets on Grammars.
Math. Syst. Theory
Seymour Ginsburg, Edwin H. Spanier
1968 — conf
Derivation-Bounded Languages
SWAT
Seymour Ginsburg, Edwin H. Spanier
1968 J jnl
Derivation-Bounded Languages.
J. Comput. Syst. Sci.
Seymour Ginsburg, Edwin H. Spanier
1968 J jnl
On the Elimination of Endmarkers
Inf. Control.
Seymour Ginsburg, Michael A. Harrison
1968 J jnl
One-way nondeterministic real-time list-storage languages.
J. ACM
Seymour Ginsburg, Michael A. Harrison
1968 — conf
Two-Way Balloon Automata and AFL
SWAT
Seymour Ginsburg, John E. Hopcroft
1967 — conf
Abstract Families of Languages
SWAT
Seymour Ginsburg, Sheila A. Greibach
1967 J jnl
Bracketed Context-Free Languages.
J. Comput. Syst. Sci.
Seymour Ginsburg, Michael A. Harrison
1967 J jnl
One-way stack automata.
J. ACM
Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison
1967 J jnl
Stack automata and compiling.
J. ACM
Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison
1966 J jnl
Ambiguity in context free languages.
J. ACM
Seymour Ginsburg, Joseph S. Ullian
1966 J jnl
Deterministic Context Free Languages
Inf. Control.
Seymour Ginsburg, Sheila A. Greibach
1966 J jnl
Mappings which Preserve Context Sensitive Languages
Inf. Control.
Seymour Ginsburg, Sheila A. Greibach
1966 — conf
One-Way Stack Automata (Extended Abstract)
SWAT
Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison
1966 J jnl
Preservation of Languages by Transducers
Inf. Control.
Seymour Ginsburg, Gene F. Rose
1966 J jnl
Preservation of unambiguity and inherent ambiguity in context-free languages.
J. ACM
Seymour Ginsburg, Joseph S. Ullian
1965 — conf
Deterministic context free languages
SWCT
Seymour Ginsburg, Sheila A. Greibach
1965 J jnl
Mappings of languages by two-tape devices.
J. ACM
Seymour Ginsburg, Edwin H. Spanier
1964 — conf
Mappings of languages by two-tape devices
SWCT
Seymour Ginsburg, Edwin H. Spanier
1964 J jnl
Solvability of Machine Mappings of Regular Sets to Regular Sets.
J. ACM
Seymour Ginsburg, Thomas N. Hibbard
1963 J jnl
Operations Which Preserve Definability in Languages.
J. ACM
Seymour Ginsburg, Gene F. Rose
1963 J jnl
Quotients of Context-Free Languages.
J. ACM
Seymour Ginsburg, Edwin H. Spanier
1963 J jnl
Some Recursively Unsolvable Problems in ALGOL-Like Languages.
J. ACM
Seymour Ginsburg, Gene F. Rose
1962 J jnl
Examples of Abstract Machines.
IRE Trans. Electron. Comput.
Seymour Ginsburg
1962 J jnl
Two Families of Languages Related to ALGOL.
J. ACM
Seymour Ginsburg, H. Gordon Rice
1961 J jnl
Compatibility of States in Input-Independent Machines.
J. ACM
Seymour Ginsburg
1961 J jnl
Sets of Tapes Accepted by Different Types of Automata.
J. ACM
Seymour Ginsburg
1961 J jnl
Theory of abstract machines.
Commun. ACM
Seymour Ginsburg
1960 J jnl
Connective Properties Preserved in Minimal State Machines.
J. ACM
Seymour Ginsburg
1959 J jnl
A Synthesis Technique for Minimal State Sequential Machines.
IRE Trans. Electron. Comput.
Seymour Ginsburg
1959 J jnl
A Technique for the Reduction of a Given Machine to a Minimal-State Machine.
IRE Trans. Electron. Comput.
Seymour Ginsburg
1959 J jnl
On the Reduction of Superfluous States in a Sequential Machine.
J. ACM
Seymour Ginsburg
1959 J jnl
Synthesis of Minimal-State Machines.
IRE Trans. Electron. Comput.
Seymour Ginsburg
1958 J jnl
On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine.
J. ACM
Seymour Ginsburg
1958 — conf
Some remarks on abstract machines.
ACM National Meeting
Seymour Ginsburg