Sheila A. Greibach

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