Some remarks on abstract machines. - Seymour Ginsburg (ACM National Meeting, 1958)

On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine. - Seymour Ginsburg (J. ACM, 1958)

On the Reduction of Superfluous States in a Sequential Machine. - Seymour Ginsburg (J. ACM, 1959)

A Synthesis Technique for Minimal State Sequential 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)

Synthesis of Minimal-State Machines. - Seymour Ginsburg (IRE Trans. Electron. Comput., 1959)

Connective Properties Preserved in Minimal State Machines. - Seymour Ginsburg (J. ACM, 1960)

Theory of abstract machines. - Seymour Ginsburg (Commun. ACM, 1961)

Sets of Tapes Accepted by Different Types of Automata. - Seymour Ginsburg (J. ACM, 1961)

Compatibility of States in Input-Independent Machines. - Seymour Ginsburg (J. ACM, 1961)

Two Families of Languages Related to ALGOL. - Seymour Ginsburg; H. Gordon Rice (J. ACM, 1962)

Examples of Abstract Machines. - Seymour Ginsburg (IRE Trans. Electron. Comput., 1962)

Some Recursively Unsolvable Problems in ALGOL-Like Languages. - Seymour Ginsburg; Gene F. Rose (J. ACM, 1963)

Operations Which Preserve Definability in Languages. - Seymour Ginsburg; Gene F. Rose (J. ACM, 1963)

Quotients of Context-Free Languages. - Seymour Ginsburg; Edwin H. Spanier (J. ACM, 1963)

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 (J. ACM, 1965)

One-Way Stack Automata (Extended Abstract) - Seymour Ginsburg; Sheila A. Greibach; Michael A. Harrison (SWAT, 1966)

Ambiguity in context free languages. - Seymour Ginsburg; Joseph S. Ullian (J. ACM, 1966)

Preservation of unambiguity and inherent ambiguity in context-free languages. - Seymour Ginsburg; Joseph S. Ullian (J. ACM, 1966)

Preservation of Languages by Transducers - Seymour Ginsburg; Gene F. Rose (Inf. Control., 1966)

Mappings which Preserve Context Sensitive Languages - Seymour Ginsburg; Sheila A. Greibach (Inf. Control., 1966)

Deterministic Context Free Languages - Seymour Ginsburg; Sheila A. Greibach (Inf. Control., 1966)

Abstract Families of Languages - Seymour Ginsburg; Sheila A. Greibach (SWAT, 1967)

Stack automata and compiling. - Seymour Ginsburg; Sheila A. Greibach; Michael A. Harrison (J. ACM, 1967)

One-way stack automata. - Seymour Ginsburg; Sheila A. Greibach; Michael A. Harrison (J. ACM, 1967)

Bracketed Context-Free Languages. - Seymour Ginsburg; Michael A. Harrison (J. Comput. Syst. Sci., 1967)

A Note on Preservation of Languages by Transducers - Seymour Ginsburg; Gene F. Rose (Inf. Control., 1968)

One-way nondeterministic real-time list-storage languages. - Seymour Ginsburg; Michael A. Harrison (J. ACM, 1968)

Derivation-Bounded Languages. - Seymour Ginsburg; Edwin H. Spanier (J. Comput. Syst. Sci., 1968)

Control Sets on Grammars. - Seymour Ginsburg; Edwin H. Spanier (Math. Syst. Theory, 1968)

On the Elimination of Endmarkers - Seymour Ginsburg; Michael A. Harrison (Inf. Control., 1968)

A Mathematical Model of Transformational Grammars - Seymour Ginsburg; Barbara Partee (Inf. Control., 1969)

On the existence of generators for certain AFL. - Seymour Ginsburg; Gene F. Rose (Inf. Sci., 1970)

Substitution in families of languages. - Seymour Ginsburg; Edwin H. Spanier (Inf. Sci., 1970)

Two-way balloon automata and AFL. - Seymour Ginsburg; John E. Hopcroft (J. ACM, 1970)

Principal AFL. - Seymour Ginsburg; Sheila A. Greibach (J. Comput. Syst. Sci., 1970)

On the Closure of AFL under Reversal - Seymour Ginsburg; Michael A. Harrison (Inf. Control., 1970)

AFL with the Semilinear Property. - Seymour Ginsburg; Edwin H. Spanier (J. Comput. Syst. Sci., 1971)

Images of AFL under Certain Families of Homomorphisms. - Seymour Ginsburg; John E. Hopcroft (Math. Syst. Theory, 1971)

Structured-Storage AFA (Abstract). - Armen Gabrielian; Seymour Ginsburg (Formal Aspects of Cognitive Processes, 1972)

Multitape AFA. - Seymour Ginsburg; Sheila A. Greibach (J. ACM, 1972)

Multi-Stack-Counter Languages. - Ronald V. Book; Seymour Ginsburg (Math. Syst. Theory, 1972)

On the Largest Full SubAFL of an AFL. - Seymour Ginsburg; Jonathan Goldstine (Math. Syst. Theory, 1972)

Substitution and (Semi-)AFL. - Seymour Ginsburg (MFCS, 1973)

On AFL Generators for Finitely Encoded AFA. - Seymour Ginsburg; Sheila A. Greibach (J. Comput. Syst. Sci., 1973)

Structured Storage AFA. - Armen Gabrielian; Seymour Ginsburg (IEEE Trans. Computers, 1973)

Intersection-Closed Full AFL and the Recursively Enumerable Languages - Seymour Ginsburg; Jonathan Goldstine (Inf. Control., 1973)

Characterization of Context-Free Grammatical Families - Armin B. Cremers; Seymour Ginsburg (SWAT, 1974)

Grammar Schemata. - Armen Gabrielian; Seymour Ginsburg (J. ACM, 1974)

The Equivalence of Stack Counter Acceptors and Quasi-Realtime Acceptors. - Seymour Ginsburg; Gene F. Rose (J. Comput. Syst. Sci., 1974)

On Incomparable Abstract Family of Languages (AFL). - Seymour Ginsburg; Edwin H. Spanier (J. Comput. Syst. Sci., 1974)

On the Periodicity of Word-Length in DOL Languages - Seymour Ginsburg; Branislav Rovan (Inf. Control., 1974)

Comparative Complexity of Grammar Forms - Seymour Ginsburg; Nancy A. Lynch (STOC, 1975)

Substitution of Grammar Forms. - Seymour Ginsburg; Edwin H. Spanier (Acta Informatica, 1975)

Context-Free Grammar Forms. - Armin B. Cremers; Seymour Ginsburg (J. Comput. Syst. Sci., 1975)

Uniformly Erasable AFL. - Seymour Ginsburg; Jonathan Goldstine; Sheila A. Greibach (J. Comput. Syst. Sci., 1975)

TOL Schemes and Control Sets - Seymour Ginsburg; Grzegorz Rozenberg (Inf. Control., 1975)

On Strict Interpretations of Grammar Forms. - Seymour Ginsburg; Otto Mayer (MFCS, 1976)

On strongly equivalent context-free grammar forms. - Seymour Ginsburg; Hermann A. Maurer (Computing, 1976)

Size complexity in context-free grammars forms. - Seymour Ginsburg; Nancy A. Lynch (J. ACM, 1976)

Some Uniformly Erasable Families of Languages. - Seymour Ginsburg; Jonathan Goldstine; Sheila A. Greibach (Theor. Comput. Sci., 1976)

Canonical Forms of Context - Free Grammars and Position Restricted Grammar Forms. - Meera Blattner; Seymour Ginsburg (FCT, 1977)

A survey of grammar forms - 1977. - Seymour Ginsburg (Acta Cybern., 1977)

On quasi-interpretations of grammar forms. - Seymour Ginsburg; Hermann A. Maurer (Computing, 1977)

The Structure of Context-Free Grammatical Families. - Armin B. Cremers; Seymour Ginsburg; Edwin H. Spanier (J. Comput. Syst. Sci., 1977)

Derivation Complexity in Context-Free Grammar Forms. - Seymour Ginsburg; Nancy A. Lynch (SIAM J. Comput., 1977)

Pushdown Acceptor Forms. - Seymour Ginsburg; Edwin H. Spanier (Theor. Comput. Sci., 1977)

Precedence Relations in Grammar Forms. - Seymour Ginsburg; Derick Wood (Acta Informatica, 1978)

Dynamic Syntax Specification Using Grammar Forms. - Seymour Ginsburg; Erica M. Rounds (IEEE Trans. Software Eng., 1978)

On Strict Interpretations of Grammar Forms. - Seymour Ginsburg; Benton L. Leong; Otto Mayer; Detlef Wotschke (Math. Syst. Theory, 1979)

Characterization for Functional Dependency and Boyce-Codd Normal Form Databases. - Seymour Ginsburg; Richard Hull 001 (XP2 Workshop on Relational Database Theory, 1981)

Ordered Attribute Domains in the Relational Model. - Seymour Ginsburg; Richard Hull 001 (XP2 Workshop on Relational Database Theory, 1981)

Strict Interpretations of Deterministic Pushdown Acceptors. - Seymour Ginsburg; Chandra M. R. Kintala (Math. Syst. Theory, 1981)

Tree acceptors and grammar forms. - Seymour Ginsburg; Otto Mayer (Computing, 1982)

Properties of functional-dependency families. - Seymour Ginsburg; Sami Mohammed Zaiddan (J. ACM, 1982)

A Prime Decomposition Theorem for Grammatical Families. - Seymour Ginsburg; Jonathan Goldstine; Edwin H. Spanier (J. Comput. Syst. Sci., 1982)

Position-Restricted Grammar Forms and Grammars. - Meera Blattner; Seymour Ginsburg (Theor. Comput. Sci., 1982)

On the Equality of Grammatical Families. - Seymour Ginsburg; Jonathan Goldstine; Edwin H. Spanier (J. Comput. Syst. Sci., 1983)

Order Dependency in the Relational Model. - Seymour Ginsburg; Richard Hull 001 (Theor. Comput. Sci., 1983)

Characterizations for Functional Dependency and Boyce-CODD Normal Form Families. - Seymour Ginsburg; Richard Hull 001 (Theor. Comput. Sci., 1983)

Tuple Sequences and Indexes. - Serge Abiteboul; Seymour Ginsburg (ICALP, 1984)

Interval Queries on Object Histories: Extended Abstract. - Seymour Ginsburg; Katsumi Tanaka (VLDB, 1984)

Computation-Tuple Sequences and Object Histories: Extended Abstract. - Seymour Ginsburg; Katsumi Tanaka (FODO, 1985)

On Completing Tables to Satisfy Functional Dependencies. - Seymour Ginsburg; Edwin H. Spanier (Theor. Comput. Sci., 1985)

Tuple sequences and lexicographic indexes. - Serge Abiteboul; Seymour Ginsburg (J. ACM, 1986)

Sort sets in the relational model. - Seymour Ginsburg; Richard Hull 001 (J. ACM, 1986)

Projection of Object Histories. - Seymour Ginsburg; Chang-jie Tang (Theor. Comput. Sci., 1986)

Computation-Tuple Sequences and Object Histories. - Seymour Ginsburg; Katsumi Tanaka (ACM Trans. Database Syst., 1986)

Canonical Forms for Interval Functions. - Seymour Ginsburg; Chang-jie Tang (Theor. Comput. Sci., 1987)

Object Histories Which Avoid Certain Subsequences - Seymour Ginsburg; Marc Gyssens (Inf. Comput., 1987)

Object-History and Spreadsheet P-Simulation. - Seymour Ginsburg; Stephen Kurtzman (ICDT, 1988)

Cohesion of Object Histories. - Seymour Ginsburg; Chang-jie Tang (Theor. Comput. Sci., 1989)

Decision Problems of Object histories - Yongkyun Cho; Seymour Ginsburg (Inf. Comput., 1989)

Input-Dependent-Only Object Histories. - Seymour Ginsburg; Dan Tian (J. Comput. Syst. Sci., 1990)

On the Decomposition of Datalog Program Mappings. - Guozhu Dong; Seymour Ginsburg (Theor. Comput. Sci., 1990)

Localizable Constraints for Object Histories. - Guozhu Dong; Seymour Ginsburg (Theor. Comput. Sci., 1991)

Pattern Matching by Rs-Operations: Toward a Unified Approach to Querying Sequenced Data. - Seymour Ginsburg; Xiaoyang Sean Wang (PODS, 1992)

Object and Spreadsheet Histories. - Seymour Ginsburg (Temporal Databases, 1993)

Content-Related Interval Queries on Object Histories - Seymour Ginsburg; Dan A. Simovici; Xiaoyang Sean Wang (Inf. Comput., 1993)

On Decompositions of Chain Datalog Programs into P (left-)linear 1-rule Components. - Guozhu Dong; Seymour Ginsburg (J. Log. Program., 1995)

Interval Queries on Object Histories. - Seymour Ginsburg; Katsumi Tanaka (Theor. Comput. Sci., 1995)

Regular Sequence Operations and Their Use in Database Queries. - Seymour Ginsburg; Xiaoyang Sean Wang (J. Comput. Syst. Sci., 1998)

Automatic Data Restructuring. - Seymour Ginsburg; Nan C. Shu; Dan A. Simovici (J. Univers. Comput. Sci., 1999)