Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarSheila A. Greibach
Sheila Adele Greibach – Sheila Carlyle-Greibach
Person information
- affiliation: University of California, Los Angeles, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2000 – 2009
- 2005
[j58]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 34(1): 5-12 (2005)
1990 – 1999
- 1992
- [c17]Sheila A. Greibach, Weiping Shi, Shai Simonson:
Single Tree Grammars. Theoretical Studies in Computer Science 1992: 73-99
1980 – 1989
- 1989
- [j57]José D. P. Rolim, Sheila A. Greibach:
A Note on the Best-Case Complexity. Inf. Process. Lett. 30(3): 133-138 (1989) - 1988
- [j56]José D. P. Rolim, Sheila A. Greibach:
On the IO-Complexity and Approximation Languages. Inf. Process. Lett. 28(1): 27-31 (1988) - 1986
- [j55]
- [c16]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: 515-533 - 1983
- [j54]Jack W. Carlyle, Sheila A. Greibach, Azaria Paz:
Matching and Spanning in Certain Planar Graphs. Mathematical Systems Theory 16(2): 159-183 (1983) - 1982
- [j53]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): 166-183 (1982) - 1981
- [j52]Sheila A. Greibach:
Formal Languages: Origins and Directions. IEEE Annals of the History of Computing 3(1): 14-41 (1981) - 1980
- [j51]Sheila A. Greibach, Emily P. Friedman:
Superdeterministic PDAs: A Subcase with a Decidable Inclusion problem. J. ACM 27(4): 675-700 (1980)
1970 – 1979
- 1979
- [j50]Sheila A. Greibach:
Linearity is Polynomially Decidable for Realtime Pushdown Store Automatia. Information and Control 42(1): 27-37 (1979) - [j49]
- [j48]Emily P. Friedman, Sheila A. Greibach:
Monadic Recursion Schemes: The Effect of Constants. J. Comput. Syst. Sci. 18(3): 254-266 (1979) - [j47]Emily P. Friedman, Sheila A. Greibach:
Superdeterministic DPDAS: The Method for Accepting Does Affect Decision Problems. J. Comput. Syst. Sci. 19(1): 79-117 (1979) - [j46]Ronald V. Book, Sheila A. Greibach, Celia Wrathall:
Reset Machines. J. Comput. Syst. Sci. 19(3): 256-276 (1979) - [c15]
- 1978
- [j45]Sheila A. Greibach:
Hierarchy Theorems for Two-Way Finite State Transducers. Acta Inf. 11: 80-101 (1978) - [j44]Sheila A. Greibach:
Visits, Crosses, and Reversals for Nondeterministic Off-Line Machines. Information and Control 36(2): 174-216 (1978) - [j43]Sheila A. Greibach:
Comments on Universal and Left Universal Grammars, Context-Sensitive Languages, and Context-Free Grammar Forms. Information and Control 39(2): 135-142 (1978) - [j42]Emily P. Friedman, Sheila A. Greibach:
On Equivalence and Subclass Containment Problems for Deterministic Context-Free Languages. Inf. Process. Lett. 7(6): 287-290 (1978) - [j41]Sheila A. Greibach:
The strong independence of substitution and homomorphic replication. ITA 12(3) (1978) - [j40]Ronald V. Book, Sheila A. Greibach:
The Independence of Certain Operations on semiAFLS. ITA 12(4) (1978) - [j39]
- [j38]Sheila A. Greibach:
Remarks on Blind and Partially Blind One-Way Multicounter Machines. Theor. Comput. Sci. 7: 311-324 (1978) - [c14]Ronald V. Book, Sheila A. Greibach, Celia Wrathall:
Comparisons and Reset Machines (Preliminary Report). ICALP 1978: 113-124 - 1977
- [j37]
- [j36]Sheila A. Greibach:
Control Sets of Context-Free Grammar Forms. J. Comput. Syst. Sci. 15(1): 35-98 (1977) - 1976
- [j35]Sheila A. Greibach:
Remarks on the Complexity of Nondeterministic Counter Languages. Theor. Comput. Sci. 1(4): 269-288 (1976) - [j34]Seymour Ginsburg, Jonathan Goldstine, Sheila A. Greibach:
Some Uniformly Erasable Families of Languages. Theor. Comput. Sci. 2(1): 29-44 (1976) - 1975
- [b1]Sheila A. Greibach:
Theory of Program Structures: Schemes, Semantics, Verification. Lecture Notes in Computer Science 36, Springer 1975, ISBN 3-540-07415-5 - [j33]
- [j32]
- [j31]Seymour Ginsburg, Jonathan Goldstine, Sheila A. Greibach:
Uniformly Erasable AFL. J. Comput. Syst. Sci. 10(2): 165-182 (1975) - [j30]Sheila A. Greibach:
One Counter Languages and the IRS Condition. J. Comput. Syst. Sci. 10(2): 237-247 (1975) - [j29]Sheila A. Greibach:
A Remark on Code Sets and Context-Free Languages. IEEE Trans. Computers 24(7): 741-742 (1975) - 1974
- [j28]Sheila A. Greibach:
Some restrictions onW-grammars. International Journal of Parallel Programming 3(4): 289-327 (1974) - [j27]Sheila A. Greibach:
Jump PDA's and Hierarchies of Deterministic Context-Free Languages. SIAM J. Comput. 3(2): 111-127 (1974) - [c13]Jack W. Carlyle, Sheila A. Greibach, Azaria Paz:
A Two-Dimensional Generating System Modeling Growth by Binary Cell Division (Preliminary Report). SWAT (FOCS) 1974: 1-12 - [c12]
- 1973
- [j26]Seymour Ginsburg, Sheila A. Greibach:
On AFL Generators for Finitely Encoded AFA. J. Comput. Syst. Sci. 7(1): 1-27 (1973) - [j25]
- [c11]Sheila A. Greibach:
Jump PDA's, Deterministic Context-Free Languages Principal AFDLs and Polynomial Time Recognition-Extended Abstract. STOC 1973: 20-28 - 1972
- [j24]Sheila A. Greibach:
A generalization of Parikh's semilinear theorem. Discrete Mathematics 2(4): 347-355 (1972) - [j23]
- [j22]
- [j21]
- [c10]Sheila Carlyle-Greibach, Seymour Ginsburg, Jonathan Goldstine:
Uniformly Erasable AFL. STOC 1972: 207-213 - 1971
- [j20]Sheila A. Greibach:
Characteristic and Ultrarealtime Languages. Information and Control 18(1): 65-98 (1971) - [j19]Ronald Vernon Book, Shimon Even, Sheila A. Greibach, Gene Ott:
Ambiguity in Graphs and Expressions. IEEE Trans. Computers 20(2): 149-153 (1971) - 1970
- [j18]Sheila A. Greibach:
Full AFLs and Nested Iterated Substitution. Information and Control 16(1): 7-35 (1970) - [j17]
- [j16]Ronald V. Book, Sheila A. Greibach, Ben Wegbreit:
Time- and Tape-Bounded Turing Acceptors and AFLs. J. Comput. Syst. Sci. 4(6): 606-621 (1970) - [j15]Ronald V. Book, Sheila A. Greibach, Oscar H. Ibarra, Ben Wegbreit:
Tape-Bounded Turing Acceptors and Principal AFLs. J. Comput. Syst. Sci. 4(6): 622-625 (1970) - [j14]Ronald V. Book, Sheila A. Greibach:
Quasi-Realtime Languages. Mathematical Systems Theory 4(2): 97-111 (1970) - [j13]
- [c9]Ronald V. Book, Sheila A. Greibach, Ben Wegbreit:
Tape- and Time-Bounded Turing Acceptors and AFLs: Extended Abstract. STOC 1970: 92-99
1960 – 1969
- 1969
- [j12]
- [j11]Sheila A. Greibach:
Checking Automata and One-Way Stack Languages. J. Comput. Syst. Sci. 3(2): 196-217 (1969) - [j10]Sheila A. Greibach, John E. Hopcroft:
Scattered Context Grammars. J. Comput. Syst. Sci. 3(3): 233-247 (1969) - [c8]
- [c7]
- 1968
- [j9]Sheila A. Greibach:
A Note on Undecidable Properties of Formal Languages. Mathematical Systems Theory 2(1): 1-6 (1968) - [c6]Sheila A. Greibach:
Checking Automata and One-Way Stack Languages (Extended Abstract). SWAT (FOCS) 1968: 287-291 - [c5]
- 1967
- [j8]Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison:
Stack automata and compiling. J. ACM 14(1): 172-201 (1967) - [j7]Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison:
One-way stack automata. J. ACM 14(2): 389-418 (1967) - [c4]
- [c3]
- 1966
- [j6]Seymour Ginsburg, Sheila A. Greibach:
Mappings which Preserve Context Sensitive Languages. Information and Control 9(6): 563-582 (1966) - [j5]Seymour Ginsburg, Sheila A. Greibach:
Deterministic Context Free Languages. Information and Control 9(6): 620-648 (1966) - [j4]Sheila A. Greibach:
The Unsolvability of the Recognition of Linear Context-Free Languages. J. ACM 13(4): 582-587 (1966) - [c2]Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison:
One-Way Stack Automata (Extended Abstract). SWAT (FOCS) 1966: 47-52 - 1965
- [j3]Sheila A. Greibach:
A New Normal-Form Theorem for Context-Free Phrase Structure Grammars. J. ACM 12(1): 42-52 (1965) - [c1]Seymour Ginsburg, Sheila A. Greibach:
Deterministic context free languages. SWCT (FOCS) 1965: 203-220 - 1964
- [j2]
- 1963
- [j1]Sheila A. Greibach:
The Undecidability of the Ambiguity Problem for Minimal Linear Grammars. Information and Control 6(2): 119-125 (1963)
Coauthor Index
maintained by 
, founded at 
, founded at 
last updated on 2019-01-11 22:15 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
