Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSheila A. 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
Books and Theses
- 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
Journal Articles
- 2005
- [j59]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): 5-12 (2005) - 1989
- [j58]José D. P. Rolim, Sheila A. Greibach:
A Note on the Best-Case Complexity. Inf. Process. Lett. 30(3): 133-138 (1989) - 1988
- [j57]José D. P. Rolim, Sheila A. Greibach:
On the IO-Complexity and Approximation Languages. Inf. Process. Lett. 28(1): 27-31 (1988) - 1986
- [j56]Sheila A. Greibach, Celia Wrathall:
Single-Tape Reset Machines. RAIRO Theor. Informatics Appl. 20(1): 55-77 (1986) - 1983
- [j55]Jack W. Carlyle, Sheila A. Greibach, Azaria Paz:
Matching and Spanning in Certain Planar Graphs. Math. Syst. Theory 16(2): 159-183 (1983) - 1982
- [j54]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
- [j53]Sheila A. Greibach:
Formal Languages: Origins and Directions. IEEE Ann. Hist. Comput. 3(1): 14-41 (1981) - [j52]Sheila A. Greibach:
Comments on the roots of theorems and languages both easy and hard. SIGACT News 13(1): 26-29 (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) - 1979
- [j50]Sheila A. Greibach:
Linearity is Polynomially Decidable for Realtime Pushdown Store Automatia. Inf. Control. 42(1): 27-37 (1979) - [j49]Sheila A. Greibach:
One counter languages and the chevron operation. RAIRO Theor. Informatics Appl. 13(2): 189-194 (1979) - [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) - 1978
- [j45]Sheila A. Greibach:
Hierarchy Theorems for Two-Way Finite State Transducers. Acta Informatica 11: 80-101 (1978) - [j44]Sheila A. Greibach:
Visits, Crosses, and Reversals for Nondeterministic Off-Line Machines. Inf. 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. Inf. 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. RAIRO Theor. Informatics Appl. 12(3): 213-234 (1978) - [j40]Ronald V. Book, Sheila A. Greibach:
The Independence of Certain Operations on semiAFLS. RAIRO Theor. Informatics Appl. 12(4): 369-385 (1978) - [j39]Sheila A. Greibach:
One Way Finite Visit Automata. Theor. Comput. Sci. 6: 175-221 (1978) - [j38]Sheila A. Greibach:
Remarks on Blind and Partially Blind One-Way Multicounter Machines. Theor. Comput. Sci. 7: 311-324 (1978) - 1977
- [j37]Sheila A. Greibach:
A Note on NSPACE(log2 n) and Substitution. RAIRO Theor. Informatics Appl. 11(2): 127-132 (1977) - [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
- [j33]Sheila A. Greibach:
Erasable Context-Free Languages. Inf. Control. 29(4): 301-326 (1975) - [j32]Sheila A. Greibach:
A Note on the Recognition of One Counter Languages. RAIRO Theor. Informatics Appl. 9(2): 5-12 (1975) - [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. Int. J. Parallel Program. 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) - 1973
- [j26]Seymour Ginsburg, Sheila A. Greibach:
On AFL Generators for Finitely Encoded AFA. J. Comput. Syst. Sci. 7(1): 1-27 (1973) - [j25]Sheila A. Greibach:
The Hardest Context-Free Language. SIAM J. Comput. 2(4): 304-310 (1973) - 1972
- [j24]Sheila A. Greibach:
A generalization of Parikh's semilinear theorem. Discret. Math. 2(4): 347-355 (1972) - [j23]Sheila A. Greibach:
Erasing in Context-Free AFLs. Inf. Control. 21(5): 436-465 (1972) - [j22]Seymour Ginsburg, Sheila A. Greibach:
Multitape AFA. J. ACM 19(2): 193-221 (1972) - [j21]Sheila A. Greibach:
Syntactic Operators on Full SemiAFLs. J. Comput. Syst. Sci. 6(1): 30-76 (1972) - 1971
- [j20]Sheila A. Greibach:
Characteristic and Ultrarealtime Languages. Inf. 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. Inf. Control. 16(1): 7-35 (1970) - [j17]Seymour Ginsburg, Sheila A. Greibach:
Principal AFL. J. Comput. Syst. Sci. 4(4): 308-338 (1970) - [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. Math. Syst. Theory 4(2): 97-111 (1970) - [j13]Sheila A. Greibach:
Chains of Full AFL's. Math. Syst. Theory 4(3): 231-242 (1970) - 1969
- [j12]Sheila A. Greibach:
An Infinite Hierarchy of Context-Free Languages. J. ACM 16(1): 91-106 (1969) - [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) - 1968
- [j9]Sheila A. Greibach:
A Note on Undecidable Properties of Formal Languages. Math. Syst. Theory 2(1): 1-6 (1968) - 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) - 1966
- [j6]Seymour Ginsburg, Sheila A. Greibach:
Mappings which Preserve Context Sensitive Languages. Inf. Control. 9(6): 563-582 (1966) - [j5]Seymour Ginsburg, Sheila A. Greibach:
Deterministic Context Free Languages. Inf. 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) - 1965
- [j3]Sheila A. Greibach:
A New Normal-Form Theorem for Context-Free Phrase Structure Grammars. J. ACM 12(1): 42-52 (1965) - 1964
- [j2]Sheila A. Greibach:
Formal parsing systems. Commun. ACM 7(8): 499-504 (1964) - 1963
- [j1]Sheila A. Greibach:
The Undecidability of the Ambiguity Problem for Minimal Linear Grammars. Inf. Control. 6(2): 119-125 (1963)
Conference and Workshop Papers
- 1992
- [c17]Sheila A. Greibach, Weiping Shi, Shai Simonson:
Single Tree Grammars. Theoretical Studies in Computer Science 1992: 73-99 - 1986
- [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 - 1979
- [c15]Sheila A. Greibach:
Formal Languages: Origins and Directions. FOCS 1979: 66-90 - 1978
- [c14]Ronald V. Book, Sheila A. Greibach, Celia Wrathall:
Comparisons and Reset Machines (Preliminary Report). ICALP 1978: 113-124 - 1974
- [c13]Jack W. Carlyle, Sheila A. Greibach, Azaria Paz:
A Two-Dimensional Generating System Modeling Growth by Binary Cell Division (Preliminary Report). SWAT 1974: 1-12 - [c12]Sheila A. Greibach:
Some Restrictions on W-Grammars. STOC 1974: 256-265 - 1973
- [c11]Sheila A. Greibach:
Jump PDA's, Deterministic Context-Free Languages Principal AFDLs and Polynomial Time Recognition-Extended Abstract. STOC 1973: 20-28 - 1972
- [c10]Sheila Carlyle-Greibach, Seymour Ginsburg, Jonathan Goldstine:
Uniformly Erasable AFL. STOC 1972: 207-213 - 1970
- [c9]Ronald V. Book, Sheila A. Greibach, Ben Wegbreit:
Tape- and Time-Bounded Turing Acceptors and AFLs: Extended Abstract. STOC 1970: 92-99 - 1969
- [c8]Sheila A. Greibach:
Full AFLs and Nested Iterated Substitution. SWAT 1969: 222-230 - [c7]Ronald V. Book, Sheila A. Greibach:
Quasi-Realtime Languages-Extended Abstract. STOC 1969: 15-18 - 1968
- [c6]Sheila A. Greibach:
Checking Automata and One-Way Stack Languages (Extended Abstract). SWAT 1968: 287-291 - [c5]Sheila A. Greibach, John E. Hopcroft:
Scattered context grammars. IFIP Congress (1) 1968: 260-264 - 1967
- [c4]Sheila A. Greibach:
An Infinite Hierarchy of Context-Free Languages. SWAT 1967: 32-36 - [c3]Seymour Ginsburg, Sheila A. Greibach:
Abstract Families of Languages. SWAT 1967: 128-139 - 1966
- [c2]Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison:
One-Way Stack Automata (Extended Abstract). SWAT 1966: 47-52 - 1965
- [c1]Seymour Ginsburg, Sheila A. Greibach:
Deterministic context free languages. SWCT 1965: 203-220
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
