Search the dblp DataBase
Seymour Ginsburg: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Seymour Ginsburg, Xiaoyang Sean Wang
Pattern Matching by Rs-Operations: Toward a Unified Approach to Querying Sequenced Data. [Citation Graph (12, 12)][DBLP]
PODS, 1992, pp:293-300 [Conf] - Seymour Ginsburg, Sami Mohammed Zaiddan
Properties of functional-dependency families. [Citation Graph (8, 0)][DBLP]
J. ACM, 1982, v:29, n:3, pp:678-698 [Journal] - Seymour Ginsburg, Katsumi Tanaka
Computation-Tuple Sequences and Object Histories. [Citation Graph (5, 5)][DBLP]
ACM Trans. Database Syst., 1986, v:11, n:2, pp:186-212 [Journal] - Seymour Ginsburg, Richard Hull
Order Dependency in the Relational Model. [Citation Graph (4, 0)][DBLP]
Theor. Comput. Sci., 1983, v:26, n:, pp:149-195 [Journal] - Seymour Ginsburg, Richard Hull
Sort sets in the relational model. [Citation Graph (2, 0)][DBLP]
J. ACM, 1986, v:33, n:3, pp:465-488 [Journal] - Seymour Ginsburg, Richard Hull
Characterizations for Functional Dependency and Boyce-CODD Normal Form Families. [Citation Graph (2, 0)][DBLP]
Theor. Comput. Sci., 1983, v:26, n:, pp:243-286 [Journal] - Seymour Ginsburg, Katsumi Tanaka
Interval Queries on Object Histories: Extended Abstract. [Citation Graph (1, 7)][DBLP]
VLDB, 1984, pp:208-217 [Conf] - Seymour Ginsburg, Marc Gyssens
Object Histories Which Avoid Certain Subsequences [Citation Graph (1, 0)][DBLP]
Inf. Comput., 1987, v:73, n:2, pp:174-206 [Journal] - Serge Abiteboul, Seymour Ginsburg
Tuple sequences and lexicographic indexes. [Citation Graph (1, 0)][DBLP]
J. ACM, 1986, v:33, n:3, pp:409-422 [Journal] - Seymour Ginsburg, Edwin H. Spanier
Mappings of languages by two-tape devices. [Citation Graph (1, 0)][DBLP]
J. ACM, 1965, v:12, n:3, pp:423-434 [Journal] - Guozhu Dong, Seymour Ginsburg
On the Decomposition of Datalog Program Mappings. [Citation Graph (1, 0)][DBLP]
Theor. Comput. Sci., 1990, v:76, n:1, pp:143-177 [Journal] - Guozhu Dong, Seymour Ginsburg
Localizable Constraints for Object Histories. [Citation Graph (1, 0)][DBLP]
Theor. Comput. Sci., 1991, v:90, n:2, pp:391-432 [Journal] - Seymour Ginsburg, Chang-jie Tang
Projection of Object Histories. [Citation Graph (1, 0)][DBLP]
Theor. Comput. Sci., 1986, v:48, n:3, pp:297-328 [Journal] - Seymour Ginsburg, Chang-jie Tang
Canonical Forms for Interval Functions. [Citation Graph (1, 0)][DBLP]
Theor. Comput. Sci., 1987, v:54, n:, pp:299-313 [Journal] - Seymour Ginsburg, Katsumi Tanaka
Interval Queries on Object Histories. [Citation Graph (1, 0)][DBLP]
Theor. Comput. Sci., 1995, v:145, n:1&2, pp:291-316 [Journal] - Armen Gabrielian, Seymour Ginsburg
Structured-Storage AFA (Abstract). [Citation Graph (0, 0)][DBLP]
Formal Aspects of Cognitive Processes, 1972, pp:70-71 [Conf] - Meera Blattner, Seymour Ginsburg
Canonical Forms of Context - Free Grammars and Position Restricted Grammar Forms. [Citation Graph (0, 0)][DBLP]
FCT, 1977, pp:49-53 [Conf] - Armin B. Cremers, Seymour Ginsburg
Characterization of Context-Free Grammatical Families [Citation Graph (0, 0)][DBLP]
FOCS, 1974, pp:199-204 [Conf] - Seymour Ginsburg, Sheila A. Greibach
Deterministic context free languages [Citation Graph (0, 0)][DBLP]
FOCS, 1965, pp:203-220 [Conf] - Seymour Ginsburg, Sheila A. Greibach
Abstract Families of Languages [Citation Graph (0, 0)][DBLP]
FOCS, 1967, pp:128-139 [Conf] - Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison
One-Way Stack Automata (Extended Abstract) [Citation Graph (0, 0)][DBLP]
FOCS, 1966, pp:47-52 [Conf] - Seymour Ginsburg, John E. Hopcroft
Two-Way Balloon Automata and AFL [Citation Graph (0, 0)][DBLP]
FOCS, 1968, pp:292-297 [Conf] - Seymour Ginsburg, Edwin H. Spanier
Mappings of languages by two-tape devices [Citation Graph (0, 0)][DBLP]
FOCS, 1964, pp:57-67 [Conf] - Seymour Ginsburg, Edwin H. Spanier
Derivation-Bounded Languages [Citation Graph (0, 0)][DBLP]
FOCS, 1968, pp:306-314 [Conf] - Seymour Ginsburg, Katsumi Tanaka
Computation-Tuple Sequences and Object Histories: Extended Abstract. [Citation Graph (0, 0)][DBLP]
FODO, 1985, pp:333-343 [Conf] - Seymour Ginsburg, Chang-jie Tang
Projection of Object Histories. [Citation Graph (0, 0)][DBLP]
FODO, 1985, pp:345-358 [Conf] - Serge Abiteboul, Seymour Ginsburg
Tuple Sequences and Indexes. [Citation Graph (0, 0)][DBLP]
ICALP, 1984, pp:41-50 [Conf] - Armin B. Cremers, Seymour Ginsburg
Context-Free Grammar Forms. [Citation Graph (0, 0)][DBLP]
ICALP, 1974, pp:364-382 [Conf] - Seymour Ginsburg, Stephen Kurtzman
Object-History and Spreadsheet P-Simulation. [Citation Graph (0, 4)][DBLP]
ICDT, 1988, pp:383-395 [Conf] - Seymour Ginsburg
Substitution and (Semi-)AFL. [Citation Graph (0, 0)][DBLP]
MFCS, 1973, pp:65-69 [Conf] - Seymour Ginsburg, Otto Mayer
On Strict Interpretations of Grammar Forms. [Citation Graph (0, 0)][DBLP]
MFCS, 1976, pp:294-298 [Conf] - Seymour Ginsburg, Richard Hull
Sort Sets in the Relational Model. [Citation Graph (0, 12)][DBLP]
PODS, 1983, pp:332-339 [Conf] - Sheila Carlyle-Greibach, Seymour Ginsburg, Jonathan Goldstine
Uniformly Erasable AFL [Citation Graph (0, 0)][DBLP]
STOC, 1972, pp:207-213 [Conf] - Seymour Ginsburg, Jonathan Goldstine
Intersection-Closed full AFL and the Recursively Enumerable Languages [Citation Graph (0, 0)][DBLP]
STOC, 1971, pp:121-131 [Conf] - Seymour Ginsburg, Nancy A. Lynch
Comparative Complexity of Grammar Forms [Citation Graph (0, 0)][DBLP]
STOC, 1975, pp:153-158 [Conf] - Guozhu Dong, Seymour Ginsburg
Localizable Constraints for Object Histories. [Citation Graph (0, 0)][DBLP]
XP7.52 Workshop on Database Theory, 1986, pp:- [Conf] - Seymour Ginsburg, Richard Hull
Characterization for Functional Dependency and Boyce-Codd Normal Form Databases. [Citation Graph (0, 0)][DBLP]
XP2 Workshop on Relational Database Theory, 1981, pp:- [Conf] - Seymour Ginsburg, Richard Hull
Ordered Attribute Domains in the Relational Model. [Citation Graph (0, 0)][DBLP]
XP2 Workshop on Relational Database Theory, 1981, pp:- [Conf] - Seymour Ginsburg, Chang-jie Tang
Cohesion of Object Histories. [Citation Graph (0, 0)][DBLP]
XP7.52 Workshop on Database Theory, 1986, pp:- [Conf] - Seymour Ginsburg, Edwin H. Spanier
Substitution of Grammar Forms [Citation Graph (0, 0)][DBLP]
Acta Inf., 1975, v:5, n:, pp:377-386 [Journal] - Seymour Ginsburg, Derick Wood
Precedence Relations in Grammar Forms. [Citation Graph (0, 0)][DBLP]
Acta Inf., 1978, v:11, n:, pp:79-88 [Journal] - Seymour Ginsburg
A survey of grammar forms - 1977. [Citation Graph (0, 0)][DBLP]
Acta Cybern., 1977, v:3, n:, pp:269-280 [Journal] - Seymour Ginsburg
Theory of abstract machines. [Citation Graph (0, 0)][DBLP]
Commun. ACM, 1961, v:4, n:4, pp:195- [Journal] - Yongkyun Cho, Seymour Ginsburg
Decision Problems of Object histories [Citation Graph (0, 0)][DBLP]
Inf. Comput., 1989, v:83, n:2, pp:245-263 [Journal] - Seymour Ginsburg, Sheila A. Greibach
Mappings which Preserve Context Sensitive Languages [Citation Graph (0, 0)][DBLP]
Information and Control, 1966, v:9, n:6, pp:563-582 [Journal] - Seymour Ginsburg, Sheila A. Greibach
Deterministic Context Free Languages [Citation Graph (0, 0)][DBLP]
Information and Control, 1966, v:9, n:6, pp:620-648 [Journal] - Seymour Ginsburg, Jonathan Goldstine
Intersection-Closed Full AFL and the Recursively Enumerable Languages [Citation Graph (0, 0)][DBLP]
Information and Control, 1973, v:22, n:3, pp:201-231 [Journal] - Seymour Ginsburg, Michael A. Harrison
On the Elimination of Endmarkers [Citation Graph (0, 0)][DBLP]
Information and Control, 1968, v:12, n:2, pp:103-115 [Journal] - Seymour Ginsburg, Michael A. Harrison
On the Closure of AFL under Reversal [Citation Graph (0, 0)][DBLP]
Information and Control, 1970, v:17, n:4, pp:395-409 [Journal] - Seymour Ginsburg, Barbara Partee
A Mathematical Model of Transformational Grammars [Citation Graph (0, 0)][DBLP]
Information and Control, 1969, v:15, n:4, pp:297-334 [Journal] - Seymour Ginsburg, Gene F. Rose
Preservation of Languages by Transducers [Citation Graph (0, 0)][DBLP]
Information and Control, 1966, v:9, n:2, pp:153-176 [Journal] - Seymour Ginsburg, Gene F. Rose
A Note on Preservation of Languages by Transducers [Citation Graph (0, 0)][DBLP]
Information and Control, 1968, v:12, n:5/6, pp:549-552 [Journal] - Seymour Ginsburg, Branislav Rovan
On the Periodicity of Word-Length in DOL Languages [Citation Graph (0, 0)][DBLP]
Information and Control, 1974, v:26, n:1, pp:34-44 [Journal] - Seymour Ginsburg, Grzegorz Rozenberg
TOL Schemes and Control Sets [Citation Graph (0, 0)][DBLP]
Information and Control, 1975, v:27, n:2, pp:109-125 [Journal] - Seymour Ginsburg, Dan A. Simovici, Xiaoyang Sean Wang
Content-Related Interval Queries on Object Histories [Citation Graph (0, 0)][DBLP]
Inf. Comput., 1993, v:103, n:1, pp:30-67 [Journal] - Seymour Ginsburg, Gene F. Rose
On the existence of generators for certain AFL. [Citation Graph (0, 0)][DBLP]
Inf. Sci., 1970, v:2, n:4, pp:431-446 [Journal] - Armen Gabrielian, Seymour Ginsburg
Grammar Schemata. [Citation Graph (0, 0)][DBLP]
J. ACM, 1974, v:21, n:2, pp:213-226 [Journal] - Seymour Ginsburg
On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine. [Citation Graph (0, 0)][DBLP]
J. ACM, 1958, v:5, n:3, pp:266-280 [Journal] - Seymour Ginsburg
On the Reduction of Superfluous States in a Sequential Machine. [Citation Graph (0, 0)][DBLP]
J. ACM, 1959, v:6, n:2, pp:259-282 [Journal] - Seymour Ginsburg
Connective Properties Preserved in Minimal State Machines. [Citation Graph (0, 0)][DBLP]
J. ACM, 1960, v:7, n:4, pp:311-325 [Journal] - Seymour Ginsburg
Sets of Tapes Accepted by Different Types of Automata. [Citation Graph (0, 0)][DBLP]
J. ACM, 1961, v:8, n:1, pp:81-86 [Journal] - Seymour Ginsburg
Compatibility of States in Input-Independent Machines. [Citation Graph (0, 0)][DBLP]
J. ACM, 1961, v:8, n:3, pp:400-403 [Journal] - Seymour Ginsburg, Sheila A. Greibach
Multitape AFA. [Citation Graph (0, 0)][DBLP]
J. ACM, 1972, v:19, n:2, pp:193-221 [Journal] - Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison
Stack automata and compiling. [Citation Graph (0, 0)][DBLP]
J. ACM, 1967, v:14, n:1, pp:172-201 [Journal] - Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison
One-way stack automata. [Citation Graph (0, 0)][DBLP]
J. ACM, 1967, v:14, n:2, pp:389-418 [Journal] - Seymour Ginsburg, Thomas N. Hibbard
Solvability of Machine Mappings of Regular Sets to Regular Sets. [Citation Graph (0, 0)][DBLP]
J. ACM, 1964, v:11, n:3, pp:302-312 [Journal] - Seymour Ginsburg, Michael A. Harrison
One-way nondeterministic real-time list-storage languages. [Citation Graph (0, 0)][DBLP]
J. ACM, 1968, v:15, n:3, pp:428-446 [Journal] - Seymour Ginsburg, John E. Hopcroft
Two-way balloon automata and AFL. [Citation Graph (0, 0)][DBLP]
J. ACM, 1970, v:17, n:1, pp:3-13 [Journal] - Seymour Ginsburg, Nancy A. Lynch
Size complexity in context-free grammars forms. [Citation Graph (0, 0)][DBLP]
J. ACM, 1976, v:23, n:4, pp:582-598 [Journal] - Seymour Ginsburg, H. Gordon Rice
Two Families of Languages Related to ALGOL. [Citation Graph (0, 0)][DBLP]
J. ACM, 1962, v:9, n:3, pp:350-371 [Journal] - Seymour Ginsburg, Gene F. Rose
Some Recursively Unsolvable Problems in ALGOL-Like Languages. [Citation Graph (0, 0)][DBLP]
J. ACM, 1963, v:10, n:1, pp:29-47 [Journal] - Seymour Ginsburg, Gene F. Rose
Operations Which Preserve Definability in Languages. [Citation Graph (0, 0)][DBLP]
J. ACM, 1963, v:10, n:2, pp:175-195 [Journal] - Seymour Ginsburg, Edwin H. Spanier
Quotients of Context-Free Languages. [Citation Graph (0, 0)][DBLP]
J. ACM, 1963, v:10, n:4, pp:487-492 [Journal] - Seymour Ginsburg, Joseph S. Ullian
Ambiguity in context free languages. [Citation Graph (0, 0)][DBLP]
J. ACM, 1966, v:13, n:1, pp:62-89 [Journal] - Seymour Ginsburg, Joseph S. Ullian
Preservation of unambiguity and inherent ambiguity in context-free languages. [Citation Graph (0, 0)][DBLP]
J. ACM, 1966, v:13, n:3, pp:364-368 [Journal] - Armin B. Cremers, Seymour Ginsburg
Context-Free Grammar Forms. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1975, v:11, n:1, pp:86-117 [Journal] - Armin B. Cremers, Seymour Ginsburg, Edwin H. Spanier
The Structure of Context-Free Grammatical Families. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1977, v:15, n:3, pp:262-279 [Journal] - Seymour Ginsburg, Dan Tian
Input-Dependent-Only Object Histories. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1990, v:40, n:3, pp:346-375 [Journal] - Seymour Ginsburg, Xiaoyang Sean Wang
Regular Sequence Operations and Their Use in Database Queries. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1998, v:56, n:1, pp:1-26 [Journal] - Seymour Ginsburg, Sheila A. Greibach
Principal AFL. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1970, v:4, n:4, pp:308-338 [Journal] - Seymour Ginsburg, Sheila A. Greibach
On AFL Generators for Finitely Encoded AFA. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1973, v:7, n:1, pp:1-27 [Journal] - Seymour Ginsburg, Jonathan Goldstine, Sheila A. Greibach
Uniformly Erasable AFL. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1975, v:10, n:2, pp:165-182 [Journal] - Seymour Ginsburg, Jonathan Goldstine, Edwin H. Spanier
A Prime Decomposition Theorem for Grammatical Families. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1982, v:24, n:3, pp:315-361 [Journal] - Seymour Ginsburg, Jonathan Goldstine, Edwin H. Spanier
On the Equality of Grammatical Families. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1983, v:26, n:2, pp:171-196 [Journal] - Seymour Ginsburg, Michael A. Harrison
Bracketed Context-Free Languages. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1967, v:1, n:1, pp:1-23 [Journal] - Seymour Ginsburg, Gene F. Rose
The Equivalence of Stack Counter Acceptors and Quasi-Realtime Acceptors. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1974, v:8, n:2, pp:243-269 [Journal] - Seymour Ginsburg, Edwin H. Spanier
Derivation-Bounded Languages. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1968, v:2, n:3, pp:228-250 [Journal] - Seymour Ginsburg, Edwin H. Spanier
AFL with the Semilinear Property. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1971, v:5, n:4, pp:365-396 [Journal] - Seymour Ginsburg, Edwin H. Spanier
On Incomparable Abstract Family of Languages (AFL). [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1974, v:9, n:1, pp:88-108 [Journal] - Guozhu Dong, Seymour Ginsburg
On Decompositions of Chain Datalog Programs into P (left-)linear 1-rule Components. [Citation Graph (0, 0)][DBLP]
J. Log. Program., 1995, v:23, n:3, pp:203-236 [Journal] - Seymour Ginsburg, Nan C. Shu, Dan A. Simovici
Automatic Data Restructuring. [Citation Graph (0, 0)][DBLP]
J. UCS, 1999, v:5, n:4, pp:243-286 [Journal] - Seymour Ginsburg, Jonathan Goldstine
On the Largest Full SubAFL of an AFL. [Citation Graph (0, 0)][DBLP]
Mathematical Systems Theory, 1972, v:6, n:3, pp:241-242 [Journal] - Seymour Ginsburg, John E. Hopcroft
Images of AFL under Certain Families of Homomorphisms. [Citation Graph (0, 0)][DBLP]
Mathematical Systems Theory, 1971, v:5, n:3, pp:216-227 [Journal] - Seymour Ginsburg, Chandra M. R. Kintala
Strict Interpretations of Deterministic Pushdown Acceptors. [Citation Graph (0, 0)][DBLP]
Mathematical Systems Theory, 1981, v:14, n:, pp:229-240 [Journal] - Seymour Ginsburg, Benton L. Leong, Otto Mayer, Detlef Wotschke
On Strict Interpretations of Grammar Forms. [Citation Graph (0, 0)][DBLP]
Mathematical Systems Theory, 1979, v:12, n:, pp:233-252 [Journal] - Seymour Ginsburg, Edwin H. Spanier
Control Sets on Grammars. [Citation Graph (0, 0)][DBLP]
Mathematical Systems Theory, 1968, v:2, n:2, pp:159-177 [Journal] - Seymour Ginsburg, Nancy A. Lynch
Derivation Complexity in Context-Free Grammar Forms. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1977, v:6, n:1, pp:123-138 [Journal] - Meera Blattner, Seymour Ginsburg
Position-Restricted Grammar Forms and Grammars. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1982, v:17, n:, pp:1-27 [Journal] - Seymour Ginsburg, Jonathan Goldstine, Sheila A. Greibach
Some Uniformly Erasable Families of Languages. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1976, v:2, n:1, pp:29-44 [Journal] - Seymour Ginsburg, Edwin H. Spanier
Pushdown Acceptor Forms. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1977, v:5, n:3, pp:307-320 [Journal] - Seymour Ginsburg, Edwin H. Spanier
On Completing Tables to Satisfy Functional Dependencies. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1985, v:39, n:, pp:309-317 [Journal] - Seymour Ginsburg, Chang-jie Tang
Cohesion of Object Histories. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1989, v:63, n:1, pp:63-90 [Journal] - Seymour Ginsburg, Erica M. Rounds
Dynamic Syntax Specification Using Grammar Forms. [Citation Graph (0, 0)][DBLP]
IEEE Trans. Software Eng., 1978, v:4, n:1, pp:44-55 [Journal]
On strongly equivalent context-free grammar forms. [Citation Graph (, )][DBLP]
Search in 0.063secs, Finished in 0.067secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002