The Undecidability of the Ambiguity Problem for Minimal Linear Grammars - Sheila A. Greibach (Inf. Control., 1963)

Formal parsing systems. - Sheila A. Greibach (Commun. ACM, 1964)

A New Normal-Form Theorem for Context-Free Phrase Structure Grammars. - Sheila A. Greibach (J. ACM, 1965)

One-Way Stack Automata (Extended Abstract) - Seymour Ginsburg; Sheila A. Greibach; Michael A. Harrison (SWAT, 1966)

The Unsolvability of the Recognition of Linear Context-Free Languages. - Sheila A. Greibach (J. ACM, 1966)

Mappings which Preserve Context Sensitive Languages - Seymour Ginsburg; Sheila A. Greibach (Inf. Control., 1966)

Deterministic Context Free Languages - Seymour Ginsburg; Sheila A. Greibach (Inf. Control., 1966)

Abstract Families of Languages - Seymour Ginsburg; Sheila A. Greibach (SWAT, 1967)

Stack automata and compiling. - Seymour Ginsburg; Sheila A. Greibach; Michael A. Harrison (J. ACM, 1967)

One-way stack automata. - Seymour Ginsburg; Sheila A. Greibach; Michael A. Harrison (J. ACM, 1967)

Checking Automata and One-Way Stack Languages (Extended Abstract) - Sheila A. Greibach (SWAT, 1968)

A Note on Undecidable Properties of Formal Languages. - Sheila A. Greibach (Math. Syst. Theory, 1968)

Quasi-Realtime Languages-Extended Abstract - Ronald V. Book; Sheila A. Greibach (STOC, 1969)

An Infinite Hierarchy of Context-Free Languages. - Sheila A. Greibach (J. ACM, 1969)

Checking Automata and One-Way Stack Languages. - Sheila A. Greibach (J. Comput. Syst. Sci., 1969)

Scattered Context Grammars. - Sheila A. Greibach; John E. Hopcroft (J. Comput. Syst. Sci., 1969)

Tape- and Time-Bounded Turing Acceptors and AFLs: Extended Abstract - Ronald V. Book; Sheila A. Greibach; Ben Wegbreit (STOC, 1970)

Tape-Bounded Turing Acceptors and Principal AFLs. - Ronald V. Book; Sheila A. Greibach; Oscar H. Ibarra; Ben Wegbreit (J. Comput. Syst. Sci., 1970)

Time- and Tape-Bounded Turing Acceptors and AFLs. - Ronald V. Book; Sheila A. Greibach; Ben Wegbreit (J. Comput. Syst. Sci., 1970)

Principal AFL. - Seymour Ginsburg; Sheila A. Greibach (J. Comput. Syst. Sci., 1970)

Quasi-Realtime Languages. - Ronald V. Book; Sheila A. Greibach (Math. Syst. Theory, 1970)

Chains of Full AFL's. - Sheila A. Greibach (Math. Syst. Theory, 1970)

Full AFLs and Nested Iterated Substitution - Sheila A. Greibach (Inf. Control., 1970)

Ambiguity in Graphs and Expressions. - Ronald Vernon Book; Shimon Even; Sheila A. Greibach; Gene Ott (IEEE Trans. Computers, 1971)

Characteristic and Ultrarealtime Languages - Sheila A. Greibach (Inf. Control., 1971)

A generalization of Parikh's semilinear theorem. - Sheila A. Greibach (Discret. Math., 1972)

Multitape AFA. - Seymour Ginsburg; Sheila A. Greibach (J. ACM, 1972)

Syntactic Operators on Full SemiAFLs. - Sheila A. Greibach (J. Comput. Syst. Sci., 1972)

Erasing in Context-Free AFLs - Sheila A. Greibach (Inf. Control., 1972)

Jump PDA's, Deterministic Context-Free Languages Principal AFDLs and Polynomial Time Recognition-Extended Abstract - Sheila A. Greibach (STOC, 1973)

On AFL Generators for Finitely Encoded AFA. - Seymour Ginsburg; Sheila A. Greibach (J. Comput. Syst. Sci., 1973)

The Hardest Context-Free Language. - Sheila A. Greibach (SIAM J. Comput., 1973)

A Two-Dimensional Generating System Modeling Growth by Binary Cell Division (Preliminary Report) - Jack W. Carlyle; Sheila A. Greibach; Azaria Paz (SWAT, 1974)

Some Restrictions on W-Grammars - Sheila A. Greibach (STOC, 1974)

Some restrictions onW-grammars. - Sheila A. Greibach (Int. J. Parallel Program., 1974)

Jump PDA's and Hierarchies of Deterministic Context-Free Languages. - Sheila A. Greibach (SIAM J. Comput., 1974)

Theory of Program Structures: Schemes, Semantics, Verification - Sheila A. Greibach (Springer, 1975)

A Note on the Recognition of One Counter Languages. - Sheila A. Greibach (RAIRO Theor. Informatics Appl., 1975)

Uniformly Erasable AFL. - Seymour Ginsburg; Jonathan Goldstine; Sheila A. Greibach (J. Comput. Syst. Sci., 1975)

One Counter Languages and the IRS Condition. - Sheila A. Greibach (J. Comput. Syst. Sci., 1975)

A Remark on Code Sets and Context-Free Languages. - Sheila A. Greibach (IEEE Trans. Computers, 1975)

Erasable Context-Free Languages - Sheila A. Greibach (Inf. Control., 1975)

Some Uniformly Erasable Families of Languages. - Seymour Ginsburg; Jonathan Goldstine; Sheila A. Greibach (Theor. Comput. Sci., 1976)

Remarks on the Complexity of Nondeterministic Counter Languages. - Sheila A. Greibach (Theor. Comput. Sci., 1976)

A Note on NSPACE(log2 n) and Substitution. - Sheila A. Greibach (RAIRO Theor. Informatics Appl., 1977)

Control Sets of Context-Free Grammar Forms. - Sheila A. Greibach (J. Comput. Syst. Sci., 1977)

Comparisons and Reset Machines (Preliminary Report). - Ronald V. Book; Sheila A. Greibach; Celia Wrathall (ICALP, 1978)

Hierarchy Theorems for Two-Way Finite State Transducers. - Sheila A. Greibach (Acta Informatica, 1978)

On Equivalence and Subclass Containment Problems for Deterministic Context-Free Languages. - Emily P. Friedman; Sheila A. Greibach (Inf. Process. Lett., 1978)

The Independence of Certain Operations on semiAFLS. - Ronald V. Book; Sheila A. Greibach (RAIRO Theor. Informatics Appl., 1978)

The strong independence of substitution and homomorphic replication. - Sheila A. Greibach (RAIRO Theor. Informatics Appl., 1978)

One Way Finite Visit Automata. - Sheila A. Greibach (Theor. Comput. Sci., 1978)

Remarks on Blind and Partially Blind One-Way Multicounter Machines. - Sheila A. Greibach (Theor. Comput. Sci., 1978)

Visits, Crosses, and Reversals for Nondeterministic Off-Line Machines - Sheila A. Greibach (Inf. Control., 1978)

Comments on Universal and Left Universal Grammars, Context-Sensitive Languages, and Context-Free Grammar Forms - Sheila A. Greibach (Inf. Control., 1978)

One counter languages and the chevron operation. - Sheila A. Greibach (RAIRO Theor. Informatics Appl., 1979)

Reset Machines. - Ronald V. Book; Sheila A. Greibach; Celia Wrathall (J. Comput. Syst. Sci., 1979)

Monadic Recursion Schemes: The Effect of Constants. - Emily P. Friedman; Sheila A. Greibach (J. Comput. Syst. Sci., 1979)

Superdeterministic DPDAS: The Method for Accepting Does Affect Decision Problems. - Emily P. Friedman; Sheila A. Greibach (J. Comput. Syst. Sci., 1979)

Linearity is Polynomially Decidable for Realtime Pushdown Store Automatia - Sheila A. Greibach (Inf. Control., 1979)

Superdeterministic PDAs: A Subcase with a Decidable Inclusion problem. - Sheila A. Greibach; Emily P. Friedman (J. ACM, 1980)

Formal Languages: Origins and Directions. - Sheila A. Greibach (IEEE Ann. Hist. Comput., 1981)

Comments on the roots of theorems and languages both easy and hard. - Sheila A. Greibach (SIGACT News, 1981)

A Polynomial Time Algorithm for Deciding the Equivalence Problem for 2-Tape Deterministic Finite State Acceptors. - Emily P. Friedman; Sheila A. Greibach (SIAM J. Comput., 1982)

Matching and Spanning in Certain Planar Graphs. - Jack W. Carlyle; Sheila A. Greibach; Azaria Paz (Math. Syst. Theory, 1983)

Complexity of pattern generation via planar parallel binary fission/fusion grammars. - Jack W. Carlyle; Sheila A. Greibach; Azaria Paz (Graph-Grammars and Their Application to Computer Science, 1986)

Single-Tape Reset Machines. - Sheila A. Greibach; Celia Wrathall (RAIRO Theor. Informatics Appl., 1986)

On the IO-Complexity and Approximation Languages. - José D. P. Rolim; Sheila A. Greibach (Inf. Process. Lett., 1988)

A Note on the Best-Case Complexity. - José D. P. Rolim; Sheila A. Greibach (Inf. Process. Lett., 1989)

Single Tree Grammars. - Sheila A. Greibach; Weiping Shi; Shai Simonson (Theoretical Studies in Computer Science, 1992)

In memory of Seymour Ginsburg 1928 - 2004. - Serge Abiteboul; Richard Hull 001; Victor Vianu; Sheila A. Greibach; Michael A. Harrison; Ellis Horowitz; Daniel J. Rosenkrantz; Jeffrey D. Ullman; Moshe Y. Vardi (SIGMOD Rec., 2005)