| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Serge Abiteboul, Richard Hull, Victor Vianu, Sheila A. Greibach, Michael A. Harrison, Ellis Horowitz, Daniel J. Rosenkrantz, Jeffrey D. Ullman, Moshe Y. Vardi |
In memory of Seymour Ginsburg 1928 - 2004.  |
SIGMOD Record  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheila A. Greibach, Weiping Shi, Shai Simonson |
Single Tree Grammars.  |
Theoretical Studies in Computer Science  |
1992 |
DBLP BibTeX RDF |
|
| 1 | José D. P. Rolim, Sheila A. Greibach |
A Note on the Best-Case Complexity.  |
Inf. Process. Lett.  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | José D. P. Rolim, Sheila A. Greibach |
On the IO-Complexity and Approximation Languages.  |
Inf. Process. Lett.  |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheila A. Greibach, Celia Wrathall |
Single-Tape Reset Machines.  |
ITA  |
1986 |
DBLP BibTeX RDF |
|
| 1 | Jack W. Carlyle, Sheila A. Greibach, Azaria Paz |
Complexity of pattern generation via planar parallel binary fission/fusion grammars.  |
Graph-Grammars and Their Application to Computer Science  |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Jack W. Carlyle, Sheila A. Greibach, Azaria Paz |
Matching and Spanning in Certain Planar Graphs.  |
Mathematical Systems Theory  |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Emily P. Friedman, Sheila A. Greibach |
A Polynomial Time Algorithm for Deciding the Equivalence Problem for 2-Tape Deterministic Finite State Acceptors.  |
SIAM J. Comput.  |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheila A. Greibach, Emily P. Friedman |
Superdeterministic PDAs: A Subcase with a Decidable Inclusion problem.  |
J. ACM  |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheila A. Greibach |
One counter languages and the chevron operation.  |
ITA  |
1979 |
DBLP BibTeX RDF |
|
| 1 | Sheila A. Greibach |
Linearity is Polynomially Decidable for Realtime Pushdown Store Automatia  |
Information and Control  |
1979 |
DBLP DOI BibTeX RDF |
|
| 1 | Emily P. Friedman, Sheila A. Greibach |
Superdeterministic DPDAS: The Method for Accepting Does Affect Decision Problems.  |
J. Comput. Syst. Sci.  |
1979 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald V. Book, Sheila A. Greibach, Celia Wrathall |
Reset Machines.  |
J. Comput. Syst. Sci.  |
1979 |
DBLP DOI BibTeX RDF |
|
| 1 | Emily P. Friedman, Sheila A. Greibach |
Monadic Recursion Schemes: The Effect of Constants.  |
J. Comput. Syst. Sci.  |
1979 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheila A. Greibach |
Formal Languages: Origins and Directions  |
FOCS  |
1979 |
DBLP DOI BibTeX RDF |
|
| 1 | Emily P. Friedman, Sheila A. Greibach |
On Equivalence and Subclass Containment Problems for Deterministic Context-Free Languages.  |
Inf. Process. Lett.  |
1978 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheila A. Greibach |
One Way Finite Visit Automata.  |
Theor. Comput. Sci.  |
1978 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheila A. Greibach |
Remarks on Blind and Partially Blind One-Way Multicounter Machines.  |
Theor. Comput. Sci.  |
1978 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald V. Book, Sheila A. Greibach |
The Independence of Certain Operations on semiAFLS.  |
ITA  |
1978 |
DBLP BibTeX RDF |
|
| 1 | Sheila A. Greibach |
The strong independence of substitution and homomorphic replication.  |
ITA  |
1978 |
DBLP BibTeX RDF |
|
| 1 | Sheila A. Greibach |
Hierarchy Theorems for Two-Way Finite State Transducers.  |
Acta Inf.  |
1978 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheila A. Greibach |
Comments on Universal and Left Universal Grammars, Context-Sensitive Languages, and Context-Free Grammar Forms  |
Information and Control  |
1978 |
RDF |
|
| 1 | Sheila A. Greibach |
Visits, Crosses, and Reversals for Nondeterministic Off-Line Machines  |
Information and Control  |
1978 |
RDF |
|
| 1 | Ronald V. Book, Sheila A. Greibach, Celia Wrathall |
Comparisons and Reset Machines (Preliminary Report).  |
ICALP  |
1978 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheila A. Greibach |
A Note on NSPACE(log2 n) and Substitution.  |
ITA  |
1977 |
DBLP BibTeX RDF |
|
| 1 | Sheila A. Greibach |
Control Sets of Context-Free Grammar Forms.  |
J. Comput. Syst. Sci.  |
1977 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheila A. Greibach |
Remarks on the Complexity of Nondeterministic Counter Languages.  |
Theor. Comput. Sci.  |
1976 |
DBLP DOI BibTeX RDF |
|
| 1 | Seymour Ginsburg, Jonathan Goldstine, Sheila A. Greibach |
Some Uniformly Erasable Families of Languages.  |
Theor. Comput. Sci.  |
1976 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheila A. Greibach |
A Note on the Recognition of One Counter Languages.  |
ITA  |
1975 |
DBLP BibTeX RDF |
|
| 1 | Sheila A. Greibach |
Erasable Context-Free Languages  |
Information and Control  |
1975 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheila A. Greibach |
A Remark on Code Sets and Context-Free Languages.  |
IEEE Trans. Computers  |
1975 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheila A. Greibach |
One Counter Languages and the IRS Condition.  |
J. Comput. Syst. Sci.  |
1975 |
DBLP DOI BibTeX RDF |
|
| 1 | Seymour Ginsburg, Jonathan Goldstine, Sheila A. Greibach |
Uniformly Erasable AFL.  |
J. Comput. Syst. Sci.  |
1975 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheila A. Greibach |
Theory of Program Structures: Schemes, Semantics, Verification  |
|
1975 |
DOI RDF |
|
| 1 | Sheila A. Greibach |
Some restrictions onW-grammars.  |
International Journal of Parallel Programming  |
1974 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheila A. Greibach |
Jump PDA's and Hierarchies of Deterministic Context-Free Languages.  |
SIAM J. Comput.  |
1974 |
DBLP DOI BibTeX RDF |
|
| 1 | Jack W. Carlyle, Sheila A. Greibach, Azaria Paz |
A Two-Dimensional Generating System Modeling Growth by Binary Cell Division (Preliminary Report)  |
SWAT (FOCS)  |
1974 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheila A. Greibach |
Some Restrictions on W-Grammars  |
STOC  |
1974 |
DBLP DOI BibTeX RDF |
|
| 1 | Seymour Ginsburg, Sheila A. Greibach |
On AFL Generators for Finitely Encoded AFA.  |
J. Comput. Syst. Sci.  |
1973 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheila A. Greibach |
The Hardest Context-Free Language.  |
SIAM J. Comput.  |
1973 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheila A. Greibach |
Jump PDA's, Deterministic Context-Free Languages Principal AFDLs and Polynomial Time Recognition-Extended Abstract  |
STOC  |
1973 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheila A. Greibach |
Erasing in Context-Free AFLs  |
Information and Control  |
1972 |
DBLP DOI BibTeX RDF |
|
| 1 | Seymour Ginsburg, Sheila A. Greibach |
Multitape AFA.  |
J. ACM  |
1972 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheila A. Greibach |
Syntactic Operators on Full SemiAFLs.  |
J. Comput. Syst. Sci.  |
1972 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheila A. Greibach |
Characteristic and Ultrarealtime Languages  |
Information and Control  |
1971 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheila A. Greibach |
Full AFLs and Nested Iterated Substitution  |
Information and Control  |
1970 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheila A. Greibach |
Chains of Full AFL's.  |
Mathematical Systems Theory  |
1970 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald V. Book, Sheila A. Greibach |
Quasi-Realtime Languages.  |
Mathematical Systems Theory  |
1970 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald V. Book, Sheila A. Greibach, Ben Wegbreit |
Time- and Tape-Bounded Turing Acceptors and AFLs.  |
J. Comput. Syst. Sci.  |
1970 |
DBLP DOI BibTeX RDF |
|
| 1 | Seymour Ginsburg, Sheila A. Greibach |
Principal AFL.  |
J. Comput. Syst. Sci.  |
1970 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald V. Book, Sheila A. Greibach, Oscar H. Ibarra, Ben Wegbreit |
Tape-Bounded Turing Acceptors and Principal AFLs.  |
J. Comput. Syst. Sci.  |
1970 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald V. Book, Sheila A. Greibach, Ben Wegbreit |
Tape- and Time-Bounded Turing Acceptors and AFLs: Extended Abstract  |
STOC  |
1970 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheila A. Greibach |
An Infinite Hierarchy of Context-Free Languages.  |
J. ACM  |
1969 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheila A. Greibach |
Checking Automata and One-Way Stack Languages.  |
J. Comput. Syst. Sci.  |
1969 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheila A. Greibach, John E. Hopcroft |
Scattered Context Grammars.  |
J. Comput. Syst. Sci.  |
1969 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheila A. Greibach |
Full AFLs and Nested Iterated Substitution  |
SWAT (FOCS)  |
1969 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald V. Book, Sheila A. Greibach |
Quasi-Realtime Languages-Extended Abstract  |
STOC  |
1969 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheila A. Greibach |
A Note on Undecidable Properties of Formal Languages.  |
Mathematical Systems Theory  |
1968 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheila A. Greibach, John E. Hopcroft |
Scattered context grammars.  |
IFIP Congress  |
1968 |
DBLP BibTeX RDF |
|
| 1 | Sheila A. Greibach |
Checking Automata and One-Way Stack Languages (Extended Abstract)  |
SWAT (FOCS)  |
1968 |
DBLP DOI BibTeX RDF |
|
| 1 | Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison |
One-way stack automata.  |
J. ACM  |
1967 |
DBLP DOI BibTeX RDF |
|
| 1 | Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison |
Stack automata and compiling.  |
J. ACM  |
1967 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheila A. Greibach |
An Infinite Hierarchy of Context-Free Languages  |
SWAT (FOCS)  |
1967 |
DBLP DOI BibTeX RDF |
|
| 1 | Seymour Ginsburg, Sheila A. Greibach |
Abstract Families of Languages  |
SWAT (FOCS)  |
1967 |
DBLP DOI BibTeX RDF |
|
| 1 | Seymour Ginsburg, Sheila A. Greibach |
Deterministic Context Free Languages  |
Information and Control  |
1966 |
RDF |
|
| 1 | Seymour Ginsburg, Sheila A. Greibach |
Mappings which Preserve Context Sensitive Languages  |
Information and Control  |
1966 |
RDF |
|
| 1 | Sheila A. Greibach |
The Unsolvability of the Recognition of Linear Context-Free Languages.  |
J. ACM  |
1966 |
DBLP DOI BibTeX RDF |
|
| 1 | Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison |
One-Way Stack Automata (Extended Abstract)  |
SWAT (FOCS)  |
1966 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheila A. Greibach |
A New Normal-Form Theorem for Context-Free Phrase Structure Grammars.  |
J. ACM  |
1965 |
DBLP DOI BibTeX RDF |
|
| 1 | Seymour Ginsburg, Sheila A. Greibach |
Deterministic context free languages  |
SWCT (FOCS)  |
1965 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheila A. Greibach |
Formal parsing systems.  |
Commun. ACM  |
1964 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheila A. Greibach |
The Undecidability of the Ambiguity Problem for Minimal Linear Grammars  |
Information and Control  |
1963 |
DBLP DOI BibTeX RDF |
|