


default search action
Sheila A. Greibach
- > Home > Persons > Sheila A. Greibach
Publications
- 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) - 1986
- [j56]Sheila A. Greibach, Celia Wrathall:
Single-Tape Reset Machines. RAIRO Theor. Informatics Appl. 20(1): 55-77 (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 - 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) - 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
- [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
- [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) - [j40]Ronald V. Book, Sheila A. Greibach:
The Independence of Certain Operations on semiAFLS. RAIRO Theor. Informatics Appl. 12(4): 369-385 (1978) - [c14]Ronald V. Book, Sheila A. Greibach, Celia Wrathall:
Comparisons and Reset Machines (Preliminary Report). ICALP 1978: 113-124 - 1976
- [j34]Seymour Ginsburg, Jonathan Goldstine, Sheila A. Greibach:
Some Uniformly Erasable Families of Languages. Theor. Comput. Sci. 2(1): 29-44 (1976) - 1975
- [j31]Seymour Ginsburg, Jonathan Goldstine, Sheila A. Greibach:
Uniformly Erasable AFL. J. Comput. Syst. Sci. 10(2): 165-182 (1975) - 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 - 1973
- [j26]Seymour Ginsburg, Sheila A. Greibach:
On AFL Generators for Finitely Encoded AFA. J. Comput. Syst. Sci. 7(1): 1-27 (1973) - 1972
- [j22]Seymour Ginsburg, Sheila A. Greibach:
Multitape AFA. J. ACM 19(2): 193-221 (1972) - [c10]Sheila Carlyle-Greibach, Seymour Ginsburg, Jonathan Goldstine:
Uniformly Erasable AFL. STOC 1972: 207-213 - 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
- [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) - [c9]Ronald V. Book, Sheila A. Greibach, Ben Wegbreit:
Tape- and Time-Bounded Turing Acceptors and AFLs: Extended Abstract. STOC 1970: 92-99 - 1969
- [j10]Sheila A. Greibach, John E. Hopcroft:
Scattered Context Grammars. J. Comput. Syst. Sci. 3(3): 233-247 (1969) - [c7]Ronald V. Book, Sheila A. Greibach:
Quasi-Realtime Languages-Extended Abstract. STOC 1969: 15-18 - 1968
- [c5]Sheila A. Greibach, John E. Hopcroft:
Scattered context grammars. IFIP Congress (1) 1968: 260-264 - 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) - [c3]Seymour Ginsburg, Sheila A. Greibach:
Abstract Families of Languages. SWAT 1967: 128-139 - 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) - [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

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.
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.
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.
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
