 | 2005 |
|---|
| 71 |       | 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) |
| 1992 |
|---|
| 70 |  | Sheila A. Greibach,
Weiping Shi,
Shai Simonson:
Single Tree Grammars.
Theoretical Studies in Computer Science 1992: 73-99 |
| 1989 |
|---|
| 69 | | José D. P. Rolim,
Sheila A. Greibach:
A Note on the Best-Case Complexity.
Inf. Process. Lett. 30(3): 133-138 (1989) |
| 1988 |
|---|
| 68 | | José D. P. Rolim,
Sheila A. Greibach:
On the IO-Complexity and Approximation Languages.
Inf. Process. Lett. 28(1): 27-31 (1988) |
| 1986 |
|---|
| 67 | | 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 |
| 66 | | Sheila A. Greibach,
Celia Wrathall:
Single-Tape Reset Machines.
ITA 20(1): 55-77 (1986) |
| 1983 |
|---|
| 65 | | Jack W. Carlyle,
Sheila A. Greibach,
Azaria Paz:
Matching and Spanning in Certain Planar Graphs.
Mathematical Systems Theory 16(2): 159-183 (1983) |
| 1982 |
|---|
| 64 | | 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 |
|---|
| 63 | | Sheila A. Greibach,
Emily P. Friedman:
Superdeterministic PDAs: A Subcase with a Decidable Inclusion problem.
J. ACM 27(4): 675-700 (1980) |
| 1979 |
|---|
| 62 | | Sheila A. Greibach:
Formal Languages: Origins and Directions
FOCS 1979: 66-90 |
| 61 | | Sheila A. Greibach:
One counter languages and the chevron operation.
ITA 13(2): (1979) |
| 60 | | Sheila A. Greibach:
Linearity is Polynomially Decidable for Realtime Pushdown Store Automatia
Information and Control 42(1): 27-37 (1979) |
| 59 | | Emily P. Friedman,
Sheila A. Greibach:
Monadic Recursion Schemes: The Effect of Constants.
J. Comput. Syst. Sci. 18(3): 254-266 (1979) |
| 58 | | 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) |
| 57 | | Ronald V. Book,
Sheila A. Greibach,
Celia Wrathall:
Reset Machines.
J. Comput. Syst. Sci. 19(3): 256-276 (1979) |
| 1978 |
|---|
| 56 | | Ronald V. Book,
Sheila A. Greibach,
Celia Wrathall:
Comparisons and Reset Machines (Preliminary Report).
ICALP 1978: 113-124 |
| 55 | | Sheila A. Greibach:
Hierarchy Theorems for Two-Way Finite State Transducers.
Acta Inf. 11: 80-101 (1978) |
| 54 | | Sheila A. Greibach:
The strong independence of substitution and homomorphic replication.
ITA 12(3): (1978) |
| 53 | | Ronald V. Book,
Sheila A. Greibach:
The Independence of Certain Operations on semiAFLS.
ITA 12(4): (1978) |
| 52 | | 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) |
| 51 | | Sheila A. Greibach:
Visits, Crosses, and Reversals for Nondeterministic Off-Line Machines
Information and Control 36(2): 174-216 (1978) |
| 50 | | 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) |
| 49 | | Sheila A. Greibach:
One Way Finite Visit Automata.
Theor. Comput. Sci. 6: 175-221 (1978) |
| 48 | | Sheila A. Greibach:
Remarks on Blind and Partially Blind One-Way Multicounter Machines.
Theor. Comput. Sci. 7: 311-324 (1978) |
| 1977 |
|---|
| 47 | | Sheila A. Greibach:
A Note on NSPACE(log2 n) and Substitution.
ITA 11(2): 127-132 (1977) |
| 46 | | Sheila A. Greibach:
Control Sets of Context-Free Grammar Forms.
J. Comput. Syst. Sci. 15(1): 35-98 (1977) |
| 1976 |
|---|
| 45 | | Sheila A. Greibach:
Remarks on the Complexity of Nondeterministic Counter Languages.
Theor. Comput. Sci. 1(4): 269-288 (1976) |
| 44 | | Seymour Ginsburg,
Jonathan Goldstine,
Sheila A. Greibach:
Some Uniformly Erasable Families of Languages.
Theor. Comput. Sci. 2(1): 29-44 (1976) |
| 1975 |
|---|
| 43 | | Sheila A. Greibach:
Theory of Program Structures: Schemes, Semantics, Verification
Springer 1975 |
| 42 | | Sheila A. Greibach:
A Remark on Code Sets and Context-Free Languages.
IEEE Trans. Computers 24(7): 741-742 (1975) |
| 41 | | Sheila A. Greibach:
A Note on the Recognition of One Counter Languages.
ITA 9(2): 5-12 (1975) |
| 40 | | Sheila A. Greibach:
Erasable Context-Free Languages
Information and Control 29(4): 301-326 (1975) |
| 39 | | Seymour Ginsburg,
Jonathan Goldstine,
Sheila A. Greibach:
Uniformly Erasable AFL.
J. Comput. Syst. Sci. 10(2): 165-182 (1975) |
| 38 | | Sheila A. Greibach:
One Counter Languages and the IRS Condition.
J. Comput. Syst. Sci. 10(2): 237-247 (1975) |
| 1974 |
|---|
| 37 | | Jack W. Carlyle,
Sheila A. Greibach,
Azaria Paz:
A Two-Dimensional Generating System Modeling Growth by Binary Cell Division (Preliminary Report)
FOCS 1974: 1-12 |
| 36 | | Sheila A. Greibach:
Some Restrictions on W-Grammars
STOC 1974: 256-265 |
| 35 | | Sheila A. Greibach:
Jump PDA's and Hierarchies of Deterministic Context-Free Languages.
SIAM J. Comput. 3(2): 111-127 (1974) |
| 1973 |
|---|
| 34 | | Sheila A. Greibach:
Jump PDA's, Deterministic Context-Free Languages Principal AFDLs and Polynomial Time Recognition-Extended Abstract
STOC 1973: 20-28 |
| 33 | | Seymour Ginsburg,
Sheila A. Greibach:
On AFL Generators for Finitely Encoded AFA.
J. Comput. Syst. Sci. 7(1): 1-27 (1973) |
| 32 | | Sheila A. Greibach:
The Hardest Context-Free Language.
SIAM J. Comput. 2(4): 304-310 (1973) |
| 1972 |
|---|
| 31 | | Sheila A. Greibach:
Erasing in Context-Free AFLs
Information and Control 21(5): 436-465 (1972) |
| 30 | | Seymour Ginsburg,
Sheila A. Greibach:
Multitape AFA.
J. ACM 19(2): 193-221 (1972) |
| 29 | | Sheila A. Greibach:
Syntactic Operators on Full SemiAFLs.
J. Comput. Syst. Sci. 6(1): 30-76 (1972) |
| 1971 |
|---|
| 28 | | Sheila A. Greibach:
Characteristic and Ultrarealtime Languages
Information and Control 18(1): 65-98 (1971) |
| 1970 |
|---|
| 27 | | Ronald V. Book,
Sheila A. Greibach,
Ben Wegbreit:
Tape- and Time-Bounded Turing Acceptors and AFLs: Extended Abstract
STOC 1970: 92-99 |
| 26 | | Sheila A. Greibach:
Full AFLs and Nested Iterated Substitution
Information and Control 16(1): 7-35 (1970) |
| 25 | | Seymour Ginsburg,
Sheila A. Greibach:
Principal AFL.
J. Comput. Syst. Sci. 4(4): 308-338 (1970) |
| 24 | | 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) |
| 23 | | 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) |
| 22 | | Ronald V. Book,
Sheila A. Greibach:
Quasi-Realtime Languages.
Mathematical Systems Theory 4(2): 97-111 (1970) |
| 21 | | Sheila A. Greibach:
Chains of Full AFL's.
Mathematical Systems Theory 4(3): 231-242 (1970) |
| 1969 |
|---|
| 20 | | Sheila A. Greibach:
Full AFLs and Nested Iterated Substitution
FOCS 1969: 222-230 |
| 19 | | Ronald V. Book,
Sheila A. Greibach:
Quasi-Realtime Languages-Extended Abstract
STOC 1969: 15-18 |
| 18 | | Sheila A. Greibach:
An Infinite Hierarchy of Context-Free Languages.
J. ACM 16(1): 91-106 (1969) |
| 17 | | Sheila A. Greibach:
Checking Automata and One-Way Stack Languages.
J. Comput. Syst. Sci. 3(2): 196-217 (1969) |
| 16 | | Sheila A. Greibach,
John E. Hopcroft:
Scattered Context Grammars.
J. Comput. Syst. Sci. 3(3): 233-247 (1969) |
| 1968 |
|---|
| 15 | | Sheila A. Greibach:
Checking Automata and One-Way Stack Languages (Extended Abstract)
FOCS 1968: 287-291 |
| 14 | | Sheila A. Greibach,
John E. Hopcroft:
Scattered context grammars.
IFIP Congress (1) 1968: 260-264 |
| 13 | | Sheila A. Greibach:
A Note on Undecidable Properties of Formal Languages.
Mathematical Systems Theory 2(1): 1-6 (1968) |
| 1967 |
|---|
| 12 | | Seymour Ginsburg,
Sheila A. Greibach:
Abstract Families of Languages
FOCS 1967: 128-139 |
| 11 | | Sheila A. Greibach:
An Infinite Hierarchy of Context-Free Languages
FOCS 1967: 32-36 |
| 10 | | Seymour Ginsburg,
Sheila A. Greibach,
Michael A. Harrison:
Stack automata and compiling.
J. ACM 14(1): 172-201 (1967) |
| 9 | | Seymour Ginsburg,
Sheila A. Greibach,
Michael A. Harrison:
One-way stack automata.
J. ACM 14(2): 389-418 (1967) |
| 1966 |
|---|
| 8 | | Seymour Ginsburg,
Sheila A. Greibach,
Michael A. Harrison:
One-Way Stack Automata (Extended Abstract)
FOCS 1966: 47-52 |
| 7 | | Seymour Ginsburg,
Sheila A. Greibach:
Mappings which Preserve Context Sensitive Languages
Information and Control 9(6): 563-582 (1966) |
| 6 | | Seymour Ginsburg,
Sheila A. Greibach:
Deterministic Context Free Languages
Information and Control 9(6): 620-648 (1966) |
| 5 | | Sheila A. Greibach:
The Unsolvability of the Recognition of Linear Context-Free Languages.
J. ACM 13(4): 582-587 (1966) |
| 1965 |
|---|
| 4 | | Seymour Ginsburg,
Sheila A. Greibach:
Deterministic context free languages
FOCS 1965: 203-220 |
| 3 | | Sheila A. Greibach:
A New Normal-Form Theorem for Context-Free Phrase Structure Grammars.
J. ACM 12(1): 42-52 (1965) |
| 1964 |
|---|
| 2 | | Sheila A. Greibach:
Formal parsing systems.
Commun. ACM 7(8): 499-504 (1964) |
| 1963 |
|---|
| 1 | | Sheila A. Greibach:
The Undecidability of the Ambiguity Problem for Minimal Linear Grammars
Information and Control 6(2): 119-125 (1963) |
