Sheila Greibach | Academic Influence

Sheila Greibach's AcademicInfluence.com Rankings

Sheila Greibach

Computer Science

#847

World Rank

#878

Historical Rank

#461

USA Rank

Database

#1458

World Rank

#1533

Historical Rank

#385

USA Rank

computer-science Degrees

Download Badge

Computer Science

Sheila Greibach's Degrees

PhD Mathematics University of California, Berkeley
Bachelors Mathematics University of California, Berkeley

Similar Degrees You Can Earn

Best Online Bachelor's in Math Ranked

Why Is Sheila Greibach Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Sheila Adele Greibach is an American researcher in formal languages in computing, automata, compiler theory and computer science. She is an Emeritus Professor of Computer Science at the University of California, Los Angeles, and notable work include working with Seymour Ginsburg and Michael A. Harrison in context-sensitive parsing using the stack automaton model.

(See a Problem?)

Sheila Greibach's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

A New Normal-Form Theorem for Context-Free Phrase Structure Grammars (1965) (283)
Remarks on Blind and Partially Blind One-Way Multicounter Machines (1978) (276)
Deterministic Context Free Languages (1965) (232)
Abstract Families of Languages (1967) (209)
One-way stack automata (1967) (202)
The Hardest Context-Free Language (1973) (170)
Theory of Program Structures: Schemes, Semantics, Verification (1976) (144)
Scattered Context Grammars (1969) (139)
Stack automata and compiling (1967) (121)
Checking Automata and One-Way Stack Languages (1969) (113)
An Infinite Hierarchy of Context-Free Languages (1967) (110)
Principal AFL (1970) (102)
Ambiguity in Graphs and Expressions (1971) (94)
Full AFLs and Nested Iterated Substitution (1969) (92)
Studies In Abstract Families Of Languages (1969) (89)
Time- and Tape-Bounded Turing Acceptors and AFLs (1970) (69)
Remarks on the Complexity of Nondeterministic Counter Languages (1976) (58)
One Way Finite Visit Automata (1978) (57)
Mappings which Preserve Context Sensitive Languages (1966) (52)
Syntactic Operators on Full SemiAFLs (1972) (49)
The Unsolvability of the Recognition of Linear Context-Free Languages (1966) (46)
Quasi-realtime languages (1970) (44)
A note on pushdown store automata and regular systems (1967) (40)
A note on undecidable properties of formal languages (1968) (37)
One Counter Languages and the IRS Condition (1975) (31)
Jump PDA's and Hierarchies of Deterministic Context-Free Languages (1974) (30)
Control Sets of Context-Free Grammar Forms (1977) (30)
The Undecidability of the Ambiguity Problem for Minimal Linear Grammars (1963) (28)
A Two-Dimensional Generating System Modeling Growth by Binary Cell Division (Preliminary Report) (1974) (25)
Formal languages: Origins and directions (1979) (25)
Superdeterministic PDAs (1980) (25)
Multitape AFA (1972) (25)
Erasable Context-Free Languages (1975) (24)
Superdeterministic DPDAS: The Method for Accepting Does Affect Decision Problems (1979) (23)
Uniformly erasable AFL (1972) (22)
Visits, Crosses, and Reversals for Nondeterministic Off-Line Machines (1978) (20)
Formal parsing systems (1964) (18)
Chains of full AFL's (1970) (18)
A Polynomial Time Algorithm for Deciding the Equivalence Problem for 2-Tape Deterministic Finite State Acceptors (1982) (17)
A Note on the Recognition of One Counter Languages (1975) (16)
Some Uniformly Erasable Families of Languages (1976) (16)
Linearity is Polynomially Decidable for Realtime Pushdown Store Automatia (1979) (16)
Tape-Bounded Turing Acceptors and Principal AFLs (1970) (16)
Erasing in Context-Free AFLs (1972) (12)
A Remark on Code Sets and Context-Free Languages (1975) (11)
Some restrictions on W-grammars (1974) (11)
Reset Machines (1979) (11)
Characteristic and Ultrarealtime Languages (1971) (10)
Hierarchy theorems for two-way finite state transducers (1978) (10)
Comments on Universal and Left Universal Grammars, Context-Sensitive Languages, and Context-Free Grammar Forms (1978) (10)
On AFL Generators for Finitely Encoded AFA (1973) (9)
On Equivalence and Subclass Containment Problems for Deterministic Context-Free Languages (1978) (9)
A generalization of Parikh's semilinear theorem (1972) (9)
One counter languages and the chevron operation (1979) (8)
Single Tree Grammars (1991) (7)
Jump PDA's, deterministic context-free languages principal AFDLs and polynomial time recognition—(Extended Abstract) (1973) (7)
Comparisons and Reset Machines (Preliminary Report) (1978) (6)
The Independence of Certain Operations on semiAFLS (1978) (6)
The strong independence of substitution and homomorphic replication (1978) (6)
Monadic Recursion Schemes: The Effect of Constants (1979) (5)
Planar Map Generation by Parallel Binary Fission/Fusion Grammars (1986) (5)
INDEPENDENCE OF AFL OPERATION. (1967) (4)
On the IO-Complexity and Approximation Languages (1988) (4)
A Note on the Best-Case Complexity (1989) (3)
In memory of Seymour Ginsburg 1928 - 2004 (2005) (3)
Checking Automata and One-Way Stack Languages (Extended Abstract) (1968) (3)
One-Way Stack Automata (Extended Abstract) (1966) (2)
Tape- and time-bounded Turing acceptors and AFLs (Extended Abstract) (1970) (2)
Quasi-realtime languages (Extended Abstract) (1969) (2)
A Note on NSPACE(log2 n) and Substitution (1977) (1)
The Equivalence Problem for Regular Expressions Over One Letter is Elementary (1974) (1)
Single-Tape Reset Machines (1986) (1)
Complexity of pattern generation via planar parallel binary fission/fusion grammars (1986) (1)
R69-18 Multitape One-Way Nonwriting Automata (1969) (0)
Reviews of Books and Papers intheComputerField DONALDL.EPLEY, Reviews Editor (1966) (0)
A NOTE ON LANGUAGES ACCEPTED BY TIME-BOUNDED NONDETERMINISTIC MACHINES. (1969) (0)
Some restrictions onW-grammars (1974) (0)
Editor's forword (1989) (0)
Eleventh Annual Switching and Automata Theory Symposium (1972) (0)
A tribute to referees (2004) (0)
Correctness and program verification (1975) (0)
Matching and spanning in certain planar graphs (1983) (0)
Single Tree Grammars 1 (1992) (0)
SIMPLE SYNTACTIC OPERATORS ON FULL SEMIAFLS**The research represented in this paper was supported in part by the National Science Foundation under Grant Number GJ-803. (1971) (0)
R69-23 The Reduction of Tape Reversals for Off-Line One-Tape Turing Machines (1969) (0)
R64-17 The Computer-Stored Thesaurus and Its Use in Concept Processing (1964) (0)
Special FOCS issue Sixteenth Annual Symposium on Foundations of Computer Science (1976) (0)
ARemarkonCodeSets andContext-Free Languages (1975) (0)
Program schemes — basic properties (1975) (0)
Monadic recursion schemes (1975) (0)
PRE-AFL (ABSTRACT FAMILY OF LANGUAGES). (1967) (0)
Comments on the roots of theorems and languages both easy and hard (1981) (0)
Program schemes — basic definitions and concepts (1975) (0)

This paper list is powered by the following services:

Other Resources About Sheila Greibach

en.wikipedia.org

What Schools Are Affiliated With Sheila Greibach?

Sheila Greibach is affiliated with the following schools: