Sheila A. Greibach

Publication Activity (10 Years)

Years Active: 1963-2005
Publications (10 Years): 0

Publications

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 Rec. 34 (1) (2005)
Sheila A. Greibach, Weiping Shi, Shai Simonson
Single Tree Grammars. Theoretical Studies in Computer Science (1992)
José D. P. Rolim, Sheila A. Greibach
A Note on the Best-Case Complexity. Inf. Process. Lett. 30 (3) (1989)
José D. P. Rolim, Sheila A. Greibach
On the IO-Complexity and Approximation Languages. Inf. Process. Lett. 28 (1) (1988)
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)
Sheila A. Greibach, Celia Wrathall
Single-Tape Reset Machines. RAIRO Theor. Informatics Appl. 20 (1) (1986)
Jack W. Carlyle, Sheila A. Greibach, Azaria Paz
Matching and Spanning in Certain Planar Graphs. Math. Syst. Theory 16 (2) (1983)
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. 11 (1) (1982)
Sheila A. Greibach
Formal Languages: Origins and Directions. IEEE Ann. Hist. Comput. 3 (1) (1981)
Sheila A. Greibach
Comments on the roots of theorems and languages both easy and hard. SIGACT News 13 (1) (1981)
Sheila A. Greibach, Emily P. Friedman
Superdeterministic PDAs: A Subcase with a Decidable Inclusion problem. J. ACM 27 (4) (1980)
Emily P. Friedman, Sheila A. Greibach
Superdeterministic DPDAS: The Method for Accepting Does Affect Decision Problems. J. Comput. Syst. Sci. 19 (1) (1979)
Sheila A. Greibach
One counter languages and the chevron operation. RAIRO Theor. Informatics Appl. 13 (2) (1979)
Ronald V. Book, Sheila A. Greibach, Celia Wrathall
Reset Machines. J. Comput. Syst. Sci. 19 (3) (1979)
Emily P. Friedman, Sheila A. Greibach
Monadic Recursion Schemes: The Effect of Constants. J. Comput. Syst. Sci. 18 (3) (1979)
Sheila A. Greibach
Linearity is Polynomially Decidable for Realtime Pushdown Store Automatia Inf. Control. 42 (1) (1979)
Sheila A. Greibach
Formal Languages: Origins and Directions FOCS (1979)
Ronald V. Book, Sheila A. Greibach, Celia Wrathall
Comparisons and Reset Machines (Preliminary Report). ICALP (1978)
Sheila A. Greibach
One Way Finite Visit Automata. Theor. Comput. Sci. 6 (1978)
Ronald V. Book, Sheila A. Greibach
The Independence of Certain Operations on semiAFLS. RAIRO Theor. Informatics Appl. 12 (4) (1978)
Sheila A. Greibach
Comments on Universal and Left Universal Grammars, Context-Sensitive Languages, and Context-Free Grammar Forms Inf. Control. 39 (2) (1978)
Sheila A. Greibach
Hierarchy Theorems for Two-Way Finite State Transducers. Acta Informatica 11 (1978)
Emily P. Friedman, Sheila A. Greibach
On Equivalence and Subclass Containment Problems for Deterministic Context-Free Languages. Inf. Process. Lett. 7 (6) (1978)
Sheila A. Greibach
Remarks on Blind and Partially Blind One-Way Multicounter Machines. Theor. Comput. Sci. 7 (1978)
Sheila A. Greibach
The strong independence of substitution and homomorphic replication. RAIRO Theor. Informatics Appl. 12 (3) (1978)
Sheila A. Greibach
Visits, Crosses, and Reversals for Nondeterministic Off-Line Machines Inf. Control. 36 (2) (1978)
Sheila A. Greibach
) and Substitution. RAIRO Theor. Informatics Appl. 11 (2) (1977)
Sheila A. Greibach
Control Sets of Context-Free Grammar Forms. J. Comput. Syst. Sci. 15 (1) (1977)
Sheila A. Greibach
Remarks on the Complexity of Nondeterministic Counter Languages. Theor. Comput. Sci. 1 (4) (1976)
Seymour Ginsburg, Jonathan Goldstine, Sheila A. Greibach
Some Uniformly Erasable Families of Languages. Theor. Comput. Sci. 2 (1) (1976)
Sheila A. Greibach
A Remark on Code Sets and Context-Free Languages. IEEE Trans. Computers 24 (7) (1975)
Sheila A. Greibach
A Note on the Recognition of One Counter Languages. RAIRO Theor. Informatics Appl. 9 (2) (1975)
Sheila A. Greibach
One Counter Languages and the IRS Condition. J. Comput. Syst. Sci. 10 (2) (1975)
Seymour Ginsburg, Jonathan Goldstine, Sheila A. Greibach
Uniformly Erasable AFL. J. Comput. Syst. Sci. 10 (2) (1975)
Sheila A. Greibach
Erasable Context-Free Languages Inf. Control. 29 (4) (1975)
Sheila A. Greibach
-grammars. Int. J. Parallel Program. 3 (4) (1974)
Sheila A. Greibach
Some Restrictions on W-Grammars STOC (1974)
Jack W. Carlyle, Sheila A. Greibach, Azaria Paz
A Two-Dimensional Generating System Modeling Growth by Binary Cell Division (Preliminary Report) SWAT (1974)
Sheila A. Greibach
Jump PDA's and Hierarchies of Deterministic Context-Free Languages. SIAM J. Comput. 3 (2) (1974)
Seymour Ginsburg, Sheila A. Greibach
On AFL Generators for Finitely Encoded AFA. J. Comput. Syst. Sci. 7 (1) (1973)
Sheila A. Greibach
Jump PDA's, Deterministic Context-Free Languages Principal AFDLs and Polynomial Time Recognition-Extended Abstract STOC (1973)
Sheila A. Greibach
The Hardest Context-Free Language. SIAM J. Comput. 2 (4) (1973)
Sheila A. Greibach
Syntactic Operators on Full SemiAFLs. J. Comput. Syst. Sci. 6 (1) (1972)
Sheila A. Greibach
A generalization of Parikh's semilinear theorem. Discret. Math. 2 (4) (1972)
Sheila A. Greibach
Erasing in Context-Free AFLs Inf. Control. 21 (5) (1972)
Seymour Ginsburg, Sheila A. Greibach
Multitape AFA. J. ACM 19 (2) (1972)
Ronald Vernon Book, Shimon Even, Sheila A. Greibach, Gene Ott
Ambiguity in Graphs and Expressions. IEEE Trans. Computers 20 (2) (1971)
Sheila A. Greibach
Characteristic and Ultrarealtime Languages Inf. Control. 18 (1) (1971)
Ronald V. Book, Sheila A. Greibach, Oscar H. Ibarra, Ben Wegbreit
Tape-Bounded Turing Acceptors and Principal AFLs. J. Comput. Syst. Sci. 4 (6) (1970)
Ronald V. Book, Sheila A. Greibach, Ben Wegbreit
Time- and Tape-Bounded Turing Acceptors and AFLs. J. Comput. Syst. Sci. 4 (6) (1970)
Ronald V. Book, Sheila A. Greibach
Quasi-Realtime Languages. Math. Syst. Theory 4 (2) (1970)
Seymour Ginsburg, Sheila A. Greibach
Principal AFL. J. Comput. Syst. Sci. 4 (4) (1970)
Ronald V. Book, Sheila A. Greibach, Ben Wegbreit
Tape- and Time-Bounded Turing Acceptors and AFLs: Extended Abstract STOC (1970)
Sheila A. Greibach
Chains of Full AFL's. Math. Syst. Theory 4 (3) (1970)
Sheila A. Greibach
Full AFLs and Nested Iterated Substitution Inf. Control. 16 (1) (1970)
Sheila A. Greibach, John E. Hopcroft
Scattered Context Grammars. J. Comput. Syst. Sci. 3 (3) (1969)
Sheila A. Greibach
An Infinite Hierarchy of Context-Free Languages. J. ACM 16 (1) (1969)
Sheila A. Greibach
Checking Automata and One-Way Stack Languages. J. Comput. Syst. Sci. 3 (2) (1969)
Ronald V. Book, Sheila A. Greibach
Quasi-Realtime Languages-Extended Abstract STOC (1969)
Sheila A. Greibach
Full AFLs and Nested Iterated Substitution SWAT (1969)
Sheila A. Greibach
A Note on Undecidable Properties of Formal Languages. Math. Syst. Theory 2 (1) (1968)
Sheila A. Greibach, John E. Hopcroft
Scattered context grammars. IFIP Congress (1) (1968)
Sheila A. Greibach
Checking Automata and One-Way Stack Languages (Extended Abstract) SWAT (1968)
Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison
One-way stack automata. J. ACM 14 (2) (1967)
Seymour Ginsburg, Sheila A. Greibach
Abstract Families of Languages SWAT (1967)
Sheila A. Greibach
An Infinite Hierarchy of Context-Free Languages SWAT (1967)
Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison
Stack automata and compiling. J. ACM 14 (1) (1967)
Seymour Ginsburg, Sheila A. Greibach
Mappings which Preserve Context Sensitive Languages Inf. Control. 9 (6) (1966)
Sheila A. Greibach
The Unsolvability of the Recognition of Linear Context-Free Languages. J. ACM 13 (4) (1966)
Seymour Ginsburg, Sheila A. Greibach
Deterministic Context Free Languages Inf. Control. 9 (6) (1966)
Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison
One-Way Stack Automata (Extended Abstract) SWAT (1966)
Seymour Ginsburg, Sheila A. Greibach
Deterministic context free languages SWCT (1965)
Sheila A. Greibach
A New Normal-Form Theorem for Context-Free Phrase Structure Grammars. J. ACM 12 (1) (1965)
Sheila A. Greibach
Formal parsing systems. Commun. ACM 7 (8) (1964)
Sheila A. Greibach
The Undecidability of the Ambiguity Problem for Minimal Linear Grammars Inf. Control. 6 (2) (1963)