Seymour Ginsburg

According to our database, Seymour Ginsburg authored at least 104 papers between 1958 and 1999.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

1999

Automatic Data Restructuring.

Seymour Ginsburg, Nan C. Shu, Dan A. Simovici

J. Univers. Comput. Sci., 1999

1998

Regular Sequence Operations and Their Use in Database Queries.

Seymour Ginsburg, Xiaoyang Sean Wang

J. Comput. Syst. Sci., 1998

1995

Interval Queries on Object Histories.

Seymour Ginsburg, Katsumi Tanaka

Theor. Comput. Sci., 1995

On Decompositions of Chain Datalog Programs into <i>P</i> (left-)linear 1-rule Components.

Guozhu Dong, Seymour Ginsburg

J. Log. Program., 1995

1993

Content-Related Interval Queries on Object Histories

Seymour Ginsburg, Dan A. Simovici, Xiaoyang Sean Wang

Inf. Comput., March, 1993

Object and Spreadsheet Histories.

Seymour Ginsburg

Proceedings of the Temporal Databases: Theory, Design, and Implementation., 1993

1992

Pattern Matching by Rs-Operations: Toward a Unified Approach to Querying Sequenced Data.

Seymour Ginsburg, Xiaoyang Sean Wang

Proceedings of the Eleventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1992

1990

On the Decomposition of Datalog Program Mappings.

Guozhu Dong, Seymour Ginsburg

Theor. Comput. Sci., 1990

Input-Dependent-Only Object Histories.

Seymour Ginsburg, Dan Tian

J. Comput. Syst. Sci., 1990

1989

Decision Problems of Object histories

Yongkyun Cho, Seymour Ginsburg

Inf. Comput., November, 1989

1988

Object-History and Spreadsheet P-Simulation.

Seymour Ginsburg, Stephen Kurtzman

Proceedings of the ICDT'88, 2nd International Conference on Database Theory, Bruges, Belgium, August 31, 1988

1987

Object Histories Which Avoid Certain Subsequences

Seymour Ginsburg, Marc Gyssens

Inf. Comput., May, 1987

Canonical Forms for Interval Functions.

Seymour Ginsburg, Chang-jie Tang

Theor. Comput. Sci., 1987

1986

Computation-Tuple Sequences and Object Histories.

Seymour Ginsburg, Katsumi Tanaka

ACM Trans. Database Syst., 1986

Tuple sequences and lexicographic indexes.

Serge Abiteboul, Seymour Ginsburg

J. ACM, 1986

Cohesion of Object Histories.

Seymour Ginsburg, Chang-jie Tang

Proceedings of the XP / 7.52 Workshop on Database Theory, 1986

Localizable Constraints for Object Histories.

Guozhu Dong, Seymour Ginsburg

Proceedings of the XP / 7.52 Workshop on Database Theory, 1986

1985

On Completing Tables to Satisfy Functional Dependencies.

Seymour Ginsburg, Edwin H. Spanier

Theor. Comput. Sci., 1985

Projection of Object Histories.

Seymour Ginsburg, Chang-jie Tang

Proceedings of the Foundations of Data Organization, 1985

Computation-Tuple Sequences and Object Histories: Extended Abstract.

Seymour Ginsburg, Katsumi Tanaka

Proceedings of the Foundations of Data Organization, 1985

1984

Interval Queries on Object Histories: Extended Abstract.

Seymour Ginsburg, Katsumi Tanaka

Proceedings of the Tenth International Conference on Very Large Data Bases, 1984

Tuple Sequences and Indexes.

Serge Abiteboul, Seymour Ginsburg

Proceedings of the Automata, 1984

1983

Characterizations for Functional Dependency and Boyce-CODD Normal Form Families.

Seymour Ginsburg, Richard Hull

Theor. Comput. Sci., 1983

Order Dependency in the Relational Model.

Seymour Ginsburg, Richard Hull

Theor. Comput. Sci., 1983

On the Equality of Grammatical Families.

Seymour Ginsburg, Jonathan Goldstine, Edwin H. Spanier

J. Comput. Syst. Sci., 1983

Sort Sets in the Relational Model.

Seymour Ginsburg, Richard Hull

Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1983

1982

Position-Restricted Grammar Forms and Grammars.

Meera Blattner, Seymour Ginsburg

Theor. Comput. Sci., 1982

A Prime Decomposition Theorem for Grammatical Families.

Seymour Ginsburg, Jonathan Goldstine, Edwin H. Spanier

J. Comput. Syst. Sci., 1982

Properties of functional-dependency families.

Seymour Ginsburg, Sami Mohammed Zaiddan

J. ACM, 1982

Tree acceptors and grammar forms.

Seymour Ginsburg, Otto Mayer

Computing, 1982

1981

Strict Interpretations of Deterministic Pushdown Acceptors.

Seymour Ginsburg, Chandra M. R. Kintala

Math. Syst. Theory, 1981

Ordered Attribute Domains in the Relational Model.

Seymour Ginsburg, Richard Hull

Proceedings of the XP2 Workshop on Relational Database Theory, 1981

Characterization for Functional Dependency and Boyce-Codd Normal Form Databases.

Seymour Ginsburg, Richard Hull

Proceedings of the XP2 Workshop on Relational Database Theory, 1981

1979

On Strict Interpretations of Grammar Forms.

Seymour Ginsburg, Benton L. Leong, Otto Mayer, Detlef Wotschke

Math. Syst. Theory, 1979

1978

Dynamic Syntax Specification Using Grammar Forms.

Seymour Ginsburg, Erica M. Rounds

IEEE Trans. Software Eng., 1978

Precedence Relations in Grammar Forms.

Seymour Ginsburg, Derick Wood

Acta Informatica, 1978

1977

Pushdown Acceptor Forms.

Seymour Ginsburg, Edwin H. Spanier

Theor. Comput. Sci., 1977

Derivation Complexity in Context-Free Grammar Forms.

Seymour Ginsburg, Nancy A. Lynch

SIAM J. Comput., 1977

The Structure of Context-Free Grammatical Families.

Armin B. Cremers, Seymour Ginsburg, Edwin H. Spanier

J. Comput. Syst. Sci., 1977

On quasi-interpretations of grammar forms.

Seymour Ginsburg, Hermann A. Maurer

Computing, 1977

A survey of grammar forms - 1977.

Seymour Ginsburg

Acta Cybern., 1977

Canonical Forms of Context - Free Grammars and Position Restricted Grammar Forms.

Meera Blattner, Seymour Ginsburg

Proceedings of the Fundamentals of Computation Theory, 1977

1976

Some Uniformly Erasable Families of Languages.

Seymour Ginsburg, Jonathan Goldstine, Sheila A. Greibach

Theor. Comput. Sci., 1976

Size complexity in context-free grammars forms.

Seymour Ginsburg, Nancy A. Lynch

J. ACM, 1976

On strongly equivalent context-free grammar forms.

Seymour Ginsburg, Hermann A. Maurer

Computing, 1976

On Strict Interpretations of Grammar Forms.

Seymour Ginsburg, Otto Mayer

Proceedings of the Mathematical Foundations of Computer Science 1976, 1976

1975

TOL Schemes and Control Sets

Seymour Ginsburg, Grzegorz Rozenberg

Inf. Control., February, 1975

Substitution of Grammar Forms.

Seymour Ginsburg, Edwin H. Spanier

Acta Informatica, 1975

Comparative Complexity of Grammar Forms

Seymour Ginsburg, Nancy A. Lynch

Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 1975

1974

On the Periodicity of Word-Length in DOL Languages

Seymour Ginsburg, Branislav Rovan

Inf. Control., September, 1974

On Incomparable Abstract Family of Languages (AFL).

Seymour Ginsburg, Edwin H. Spanier

J. Comput. Syst. Sci., 1974

The Equivalence of Stack Counter Acceptors and Quasi-Realtime Acceptors.

Seymour Ginsburg, Gene F. Rose

J. Comput. Syst. Sci., 1974

Grammar Schemata.

Armen Gabrielian, Seymour Ginsburg

J. ACM, 1974

Context-Free Grammar Forms.

Armin B. Cremers, Seymour Ginsburg

Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29, 1974

Characterization of Context-Free Grammatical Families

Armin B. Cremers, Seymour Ginsburg

Proceedings of the 15th Annual Symposium on Switching and Automata Theory, 1974

1973

Structured Storage AFA.

Armen Gabrielian, Seymour Ginsburg

IEEE Trans. Computers, 1973

On AFL Generators for Finitely Encoded AFA.

Seymour Ginsburg, Sheila A. Greibach

J. Comput. Syst. Sci., 1973

Substitution and (Semi-)AFL.

Seymour Ginsburg

Proceedings of the Mathematical Foundations of Computer Science: Proceedings of Symposium and Summer School, 1973

1972

On the Largest Full SubAFL of an AFL.

Seymour Ginsburg, Jonathan Goldstine

Math. Syst. Theory, 1972

Multi-Stack-Counter Languages.

Ronald V. Book, Seymour Ginsburg

Math. Syst. Theory, 1972

Multitape AFA.

Seymour Ginsburg, Sheila A. Greibach

J. ACM, 1972

Uniformly Erasable AFL

Sheila Carlyle-Greibach, Seymour Ginsburg, Jonathan Goldstine

Proceedings of the 4th Annual ACM Symposium on Theory of Computing, 1972

Structured-Storage AFA (Abstract).

Armen Gabrielian, Seymour Ginsburg

Proceedings of the Formal Aspects of Cognitive Processes, 1972

1971

Images of AFL under Certain Families of Homomorphisms.

Seymour Ginsburg, John E. Hopcroft

Math. Syst. Theory, 1971

AFL with the Semilinear Property.

Seymour Ginsburg, Edwin H. Spanier

J. Comput. Syst. Sci., 1971

Intersection-Closed full AFL and the Recursively Enumerable Languages

Seymour Ginsburg, Jonathan Goldstine

Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, 1971

1970

On the Closure of AFL under Reversal

Seymour Ginsburg, Michael A. Harrison

Inf. Control., November, 1970

Principal AFL.

Seymour Ginsburg, Sheila A. Greibach

J. Comput. Syst. Sci., 1970

Substitution in families of languages.

Seymour Ginsburg, Edwin H. Spanier

Inf. Sci., 1970

On the existence of generators for certain AFL.

Seymour Ginsburg, Gene F. Rose

Inf. Sci., 1970

1969

A Mathematical Model of Transformational Grammars

Seymour Ginsburg, Barbara Partee

Inf. Control., October, 1969

1968

On the Elimination of Endmarkers

Seymour Ginsburg, Michael A. Harrison

Inf. Control., February, 1968

Control Sets on Grammars.

Seymour Ginsburg, Edwin H. Spanier

Math. Syst. Theory, 1968

One-way nondeterministic real-time list-storage languages.

Seymour Ginsburg, Michael A. Harrison

J. ACM, 1968

A Note on Preservation of Languages by Transducers

Seymour Ginsburg, Gene F. Rose

Inf. Control., 1968

Derivation-Bounded Languages

Seymour Ginsburg, Edwin H. Spanier

Proceedings of the 9th Annual Symposium on Switching and Automata Theory, 1968

Two-Way Balloon Automata and AFL

Seymour Ginsburg, John E. Hopcroft

Proceedings of the 9th Annual Symposium on Switching and Automata Theory, 1968

1967

Bracketed Context-Free Languages.

Seymour Ginsburg, Michael A. Harrison

J. Comput. Syst. Sci., 1967

One-way stack automata.

Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison

J. ACM, 1967

Stack automata and compiling.

Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison

J. ACM, 1967

Abstract Families of Languages

Seymour Ginsburg, Sheila A. Greibach

Proceedings of the 8th Annual Symposium on Switching and Automata Theory, 1967

1966

Mappings which Preserve Context Sensitive Languages

Seymour Ginsburg, Sheila A. Greibach

Inf. Control., December, 1966

Preservation of Languages by Transducers

Seymour Ginsburg, Gene F. Rose

Inf. Control., April, 1966

Preservation of unambiguity and inherent ambiguity in context-free languages.

Seymour Ginsburg, Joseph S. Ullian

J. ACM, 1966

Ambiguity in context free languages.

Seymour Ginsburg, Joseph S. Ullian

J. ACM, 1966

One-Way Stack Automata (Extended Abstract)

Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison

Proceedings of the 7th Annual Symposium on Switching and Automata Theory, 1966

1965

Deterministic context free languages

Seymour Ginsburg, Sheila A. Greibach

Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design, 1965

1964

Solvability of Machine Mappings of Regular Sets to Regular Sets.

Seymour Ginsburg, Thomas N. Hibbard

J. ACM, 1964

Mappings of languages by two-tape devices

Seymour Ginsburg, Edwin H. Spanier

Proceedings of the 5th Annual Symposium on Switching Circuit Theory and Logical Design, 1964

1963

Quotients of Context-Free Languages.

Seymour Ginsburg, Edwin H. Spanier

J. ACM, 1963

Operations Which Preserve Definability in Languages.

Seymour Ginsburg, Gene F. Rose

J. ACM, 1963

Some Recursively Unsolvable Problems in ALGOL-Like Languages.

Seymour Ginsburg, Gene F. Rose

J. ACM, 1963

1962

Examples of Abstract Machines.

Seymour Ginsburg

IRE Trans. Electron. Comput., 1962

Two Families of Languages Related to ALGOL.

Seymour Ginsburg, H. Gordon Rice

J. ACM, 1962

1961

Compatibility of States in Input-Independent Machines.

Seymour Ginsburg

J. ACM, 1961

Sets of Tapes Accepted by Different Types of Automata.

Seymour Ginsburg

J. ACM, 1961

Theory of abstract machines.

Seymour Ginsburg

Commun. ACM, 1961

1960

Connective Properties Preserved in Minimal State Machines.

Seymour Ginsburg

J. ACM, 1960

1959

Synthesis of Minimal-State Machines.

Seymour Ginsburg

IRE Trans. Electron. Comput., 1959

A Technique for the Reduction of a Given Machine to a Minimal-State Machine.

Seymour Ginsburg

IRE Trans. Electron. Comput., 1959

A Synthesis Technique for Minimal State Sequential Machines.

Seymour Ginsburg

IRE Trans. Electron. Comput., 1959

On the Reduction of Superfluous States in a Sequential Machine.

Seymour Ginsburg

J. ACM, 1959

1958

On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine.

Seymour Ginsburg

J. ACM, 1958

Some remarks on abstract machines.

Seymour Ginsburg

Proceedings of the Preprints of papers presented at the 13th national meeting of the Association for Computing Machinery, 1958