Seymour Ginsburg | Academic Influence

Seymour Ginsburg's AcademicInfluence.com Rankings

Seymour Ginsburg

Computer Science

#554

World Rank

#574

Historical Rank

#304

USA Rank

computer-science Degrees

Seymour Ginsburg

Mathematics

#2305

World Rank

#3584

Historical Rank

#920

USA Rank

Measure Theory

#912

World Rank

#1194

Historical Rank

#340

USA Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Seymour Ginsburg's Degrees

PhD Mathematics Princeton University
Bachelors Mathematics Columbia University

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Seymour Ginsburg Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Seymour Ginsburg was an American pioneer of automata theory, formal language theory, and database theory, in particular; and computer science, in general. His work was influential in distinguishing theoretical Computer Science from the disciplines of Mathematics and Electrical Engineering.

(See a Problem?)

Seymour Ginsburg's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

The mathematical theory of context free languages (1966) (1105)
Semigroups, Presburger formulas, and languages. (1966) (404)
Algebraic and Automata Theoretic Properties of Formal Languages (1975) (340)
Two Families of Languages Related to ALGOL (1962) (278)
BOUNDED ALGOL-LIKE LANGUAGES^) (1964) (263)
Deterministic Context Free Languages (1965) (232)
Abstract Families of Languages (1967) (209)
One-way stack automata (1967) (202)
Finite-Turn Pushdown Automata (1966) (172)
Bounded -like languages (1964) (129)
Stack automata and compiling (1967) (121)
Ambiguity in context free languages (1966) (118)
Principal AFL (1970) (102)
Order Dependency in the Relational Model (1983) (100)
BOUNDED REGULAR SETS (1966) (99)
SOME OPERATORS ON UNIFORM SPACES (1959) (95)
Bracketed Context-Free Languages (1967) (94)
Context-Free Grammar Forms (1974) (91)
Derivation-Bounded Languages (1968) (89)
Studies In Abstract Families Of Languages (1969) (89)
Operations Which Preserve Definability in Languages (1963) (61)
AFL with the Semilinear Property (1971) (57)
THE CATEGORY OF COFINAL TYPES. I (1965) (56)
Mappings which Preserve Context Sensitive Languages (1966) (52)
TOL Schemes and Control Sets (1975) (51)
On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine (1958) (50)
Introduction to Mathematical Machine Theory (1982) (49)
Control sets on grammars (1968) (46)
Pattern matching by Rs-operations: towards a unified approach to querying sequenced data (1992) (45)
Mappings of languages by two-tape devices (1964) (43)
Preservation of Languages by Transducers (1966) (43)
Properties of functional-dependency families (1982) (41)
A Characterization of Machine Mappings (1966) (38)
A Mathematical Model of Transformational Grammars (1969) (35)
Some Recursively Unsolvable Problems in ALGOL-Like Languages (1963) (33)
On the Reduction of Superfluous States in a Sequential Machine (1959) (33)
Quotients of Context-Free Languages (1963) (32)
Substitution in families of languages (1970) (30)
Acyclic logic programs and the completeness of SLDNF-resolution (1991) (28)
Some remarks on abstract machines (1958) (26)
Sort sets in the relational model (1983) (25)
Multitape AFA (1972) (25)
Computation-tuple sequences and object histories (1986) (25)
A Technique for the Reduction of a Given Machine to a Minimal-State Machine (1959) (24)
Uniformly erasable AFL (1972) (22)
Examples of Abstract Machines (1962) (22)
One-way nondeterministic real-time list-storage languages (1968) (22)
Synthesis of Minimal-State Machines (1959) (20)
Intersection-closed full AFL and the recursively enumerable languages (1971) (20)
Some remarks on order types and decompositions of sets (1953) (20)
Regular Sequence Operations and Their Use in Database Queries (1998) (19)
Preservation of unambiguity and inherent ambiguity in context-free languages (1966) (18)
Two-way balloon automata and AFL (1968) (17)
The Structure of Context-Free Grammatical Families (1977) (16)
Characterizations for Functional Dependency and Boyce-CODD Normal Form Families (1983) (16)
Some Uniformly Erasable Families of Languages (1976) (16)
A Note on Preservation of Languages by Transducers (1968) (15)
A Synthesis Technique for Minimal State Sequential Machines (1959) (15)
Sort sets in the relational model (1986) (13)
Ordered Attribute Domains in the Relational Model (1981) (13)
Order types and similarity transformations (1955) (12)
Tuple sequences and lexicographic indexes (1986) (11)
Position-Restricted Grammar Forms and Grammars (1982) (11)
On Decompositions of Chain Datalog Programs into P (left-)linear 1-rule Components (1995) (11)
Connective Properties Preserved in Minimal State Machines (1960) (10)
Size complexity in context-free grammars forms (1976) (10)
Further results on order types and decompositions of sets (1954) (10)
A survey of grammar forms - 1977 (1977) (10)
Solvability of Machine Mappings of Regular Sets to Regular Sets (1964) (10)
On Incomparable Abstract Family of Languages (AFL) (1974) (9)
On AFL Generators for Finitely Encoded AFA (1973) (9)
Sets of Tapes Accepted by Different Types of Automata (1961) (8)
Fixed points of products and ordered sums of simply ordered sets (1954) (8)
Proceedings of the fourth annual ACM symposium on Theory of computing (1969) (8)
Grammar Schemata (1974) (8)
On the Closure of AFL under Reversal (1970) (8)
Dynamic Syntax Specification Using Grammar Forms (1978) (7)
On the Decomposition of Datalog Program Mappings (1990) (7)
On the existence of generators for certain AFL (1970) (7)
On Completing Tables to Satisfy Functional Dependencies (1985) (6)
Canonical Forms of Context - Free Grammars and Position Restricted Grammar Forms (1977) (6)
On the distinct sums of λ-type transfinite series obtained by permuting the elements of a fixed λ-type series (1952) (6)
The Equivalence of Stack Counter Acceptors and Quasi-Realtime Acceptors (1974) (6)
Sequences in context free languages (1965) (6)
Object Histories Which Avoid Certain Subsequences (1987) (5)
Interval Queries on Object Histories: Extended Abstract (1984) (5)
On the Periodicity of Word-Length in DOL Languages (1974) (5)
Derivation Complexity in Context-Free Grammar Forms (1977) (5)
Comparative complexity of grammar forms (1975) (5)
METHODS FOR SPECIFYING FAMILIES OF FORMAL LANGUAGES — PAST-PRESENT-FUTURE (1980) (5)
Projection of Object Histories (1986) (5)
Multi-stack-counter languages (1972) (4)
Localizable Constraints for Object Histories (1986) (4)
A class of everywhere branching sets (1953) (4)
Distinguishability of a semi-group by a machine (1961) (4)
On the Largest Full SubAFL of an AFL (1972) (4)
On strict interpretations of grammar forms (1978) (4)
Characterization of Context-Free Grammatical Families (1974) (4)
Compatibility of States in Input-Independent Machines (1961) (4)
On the λ-Dimension and the A-Dimension of Partially Ordered Sets (1954) (3)
Review: J. Hartmanis, Context-free Languages and Turing Machine Computations (1972) (3)
Cohesion of Object Histories (1989) (3)
Canonical Forms for Interval Functions (1987) (2)
On the Equality of Grammatical Families (1983) (2)
On the existence of complete Boolean algebras whose principal ideals are isomorphic to each other (1958) (2)
A Prime Decomposition Theorem for Grammatical Families (1982) (2)
One-Way Stack Automata (Extended Abstract) (1966) (2)
Hartmanis J.. Context-free languages and Turing machine computations. Mathematical aspects of computer science , Proceedings of symposia in applied mathematics, vol. 19, American Mathematical Society, Providence 1967, pp. 42–51. (1972) (2)
Tuple Sequences and Indexes (1984) (2)
On the Elimination of Endmarkers (1968) (2)
Pushdown Acceptor Forms (1977) (2)
Real-valued functions on partially ordered sets (1953) (2)
On strongly equivalent context-free grammar forms (1976) (2)
Structured Storage AFA (1973) (2)
Object-History and Spreadsheet P-Simulation (1988) (1)
Sets Which are Not Homeomorphic by m-Decomposition (1956) (1)
Substitution and (Semi-)AFL (1973) (1)
R63-73 Signal Flow Graph Techniques for Sequential Circuit State Diagrams (1963) (1)
Substitution of grammar forms (1975) (1)
Uniqueness in the left division of order types (1955) (1)
SOME REMARKS ABOUT SEQUENCES IN CONTEXT FREE LANGUAGES (1963) (1)
Images of AFL under certain families of homomorphisms (1971) (1)
Characterization for Functional Dependency and Boyce-Codd Normal Form Databases (1981) (1)
Theory of abstract machines (1961) (1)
A comparison of the work done by generalized sequential machines and Turing machines (1962) (1)
Content-Related Interval Queries on Object Histories (1993) (1)
Interval Queries on Object Histories (1995) (1)
Object and Spreadsheet Histories (1993) (1)
Greibach Sheila A.. The unsolvability of the recognition of linear context-free languages. Journal of the Association for Computing Machinery, vol. 13 (1966), pp. 582–587. (1971) (0)
Strict interpretations of deterministic pushdown acceptors (1981) (0)
Aho Alfred V. and Ullman Jeffrey D.. The theory of languages. Mathematical systems theory , vol. 2 (1968), pp. 97–125. (1971) (0)
Decision Problems of Object histories (1989) (0)
ALGORITHMIC LANGUAGES PROJECT. (1965) (0)
Some remarks on a relation between sets and elements (1952) (0)
On quasi-interpretations of grammar forms (1977) (0)
ONE-WAY REAL-TIME LIST-STORAGE LANGUAGES, (1967) (0)
Tree acceptors and grammar forms (1982) (0)
PRE-AFL (ABSTRACT FAMILY OF LANGUAGES). (1967) (0)
Precedence relations in grammar forms (1978) (0)
Muhitape AFA SHEILA GREIBACH University of California at Los Angeles , Los Angeles , California * AND (2000) (0)
Input-Dependent-Only Object Histories (1990) (0)
Review: Alfred V. Aho, Jeffrey D. Ullman, The Theory of Languages (1971) (0)
Automatic Data Restructuring (1999) (0)
On a class of pathological functions (1955) (0)
ANNUAL REPORT ON ALGORITHMIC LANGUAGES PROJECT. (1967) (0)
A cardinal number associated with a family of sets (1953) (0)
Computation-Tuple Sequences and Object Histories: Extended Abstract (1985) (0)
Review: Sheila A. Greibach, The Unsolvability of the Recognition of Linear Context-free Languages (1971) (0)
THE NOVEMBER MEETING IN RALEIGH The four hundred eighty-fifth meeting of the American Mathe - (2007) (0)
THEORY OF PROGRAMMING (ALGORITHMIC) LANGUAGES PROJECT. (1970) (0)
Declarative Sequence Operations and Their Usage in Query Languages t (0)
Object histories with contexts and context-related constraints (1991) (0)
On mappings from the family of well ordered subsets of a set. (1956) (0)
Structured-Storage AFA (Abstract) (1972) (0)
Decompositions of a set into disjoint pairs (1955) (0)

This paper list is powered by the following services:

Other Resources About Seymour Ginsburg

en.wikipedia.org

What Schools Are Affiliated With Seymour Ginsburg?

Seymour Ginsburg is affiliated with the following schools: