Search the dblp DataBase
Sheila A. Greibach :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Sheila A. Greibach A New Normal-Form Theorem for Context-Free Phrase Structure Grammars. [Citation Graph (1, 0)][DBLP ] J. ACM, 1965, v:12, n:1, pp:42-52 [Journal ] Sheila A. Greibach Checking Automata and One-Way Stack Languages. [Citation Graph (1, 0)][DBLP ] J. Comput. Syst. Sci., 1969, v:3, n:2, pp:196-217 [Journal ] Sheila A. Greibach The Hardest Context-Free Language. [Citation Graph (1, 0)][DBLP ] SIAM J. Comput., 1973, v:2, n:4, pp:304-310 [Journal ] Sheila A. Greibach , Weiping Shi , Shai Simonson Single Tree Grammars. [Citation Graph (0, 0)][DBLP ] Theoretical Studies in Computer Science, 1992, pp:73-99 [Conf ] Jack W. Carlyle , Sheila A. Greibach , Azaria Paz A Two-Dimensional Generating System Modeling Growth by Binary Cell Division (Preliminary Report) [Citation Graph (0, 0)][DBLP ] FOCS, 1974, pp:1-12 [Conf ] Seymour Ginsburg , Sheila A. Greibach Deterministic context free languages [Citation Graph (0, 0)][DBLP ] FOCS, 1965, pp:203-220 [Conf ] Seymour Ginsburg , Sheila A. Greibach Abstract Families of Languages [Citation Graph (0, 0)][DBLP ] FOCS, 1967, pp:128-139 [Conf ] Seymour Ginsburg , Sheila A. Greibach , Michael A. Harrison One-Way Stack Automata (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1966, pp:47-52 [Conf ] Sheila A. Greibach An Infinite Hierarchy of Context-Free Languages [Citation Graph (0, 0)][DBLP ] FOCS, 1967, pp:32-36 [Conf ] Sheila A. Greibach Checking Automata and One-Way Stack Languages (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1968, pp:287-291 [Conf ] Sheila A. Greibach Full AFLs and Nested Iterated Substitution [Citation Graph (0, 0)][DBLP ] FOCS, 1969, pp:222-230 [Conf ] Sheila A. Greibach Formal Languages: Origins and Directions [Citation Graph (0, 0)][DBLP ] FOCS, 1979, pp:66-90 [Conf ] Jack W. Carlyle , Sheila A. Greibach , Azaria Paz Complexity of pattern generation via planar parallel binary fission/fusion grammars. [Citation Graph (0, 0)][DBLP ] Graph-Grammars and Their Application to Computer Science, 1986, pp:515-533 [Conf ] Ronald V. Book , Sheila A. Greibach , Celia Wrathall Comparisons and Reset Machines (Preliminary Report). [Citation Graph (0, 0)][DBLP ] ICALP, 1978, pp:113-124 [Conf ] Sheila A. Greibach , John E. Hopcroft Scattered context grammars. [Citation Graph (0, 0)][DBLP ] IFIP Congress (1), 1968, pp:260-264 [Conf ] Ronald V. Book , Sheila A. Greibach Quasi-Realtime Languages-Extended Abstract [Citation Graph (0, 0)][DBLP ] STOC, 1969, pp:15-18 [Conf ] Ronald V. Book , Sheila A. Greibach , Ben Wegbreit Tape- and Time-Bounded Turing Acceptors and AFLs: Extended Abstract [Citation Graph (0, 0)][DBLP ] STOC, 1970, pp:92-99 [Conf ] Sheila A. Greibach Jump PDA's, Deterministic Context-Free Languages Principal AFDLs and Polynomial Time Recognition-Extended Abstract [Citation Graph (0, 0)][DBLP ] STOC, 1973, pp:20-28 [Conf ] Sheila A. Greibach Some Restrictions on W-Grammars [Citation Graph (0, 0)][DBLP ] STOC, 1974, pp:256-265 [Conf ] Sheila A. Greibach Hierarchy Theorems for Two-Way Finite State Transducers. [Citation Graph (0, 0)][DBLP ] Acta Inf., 1978, v:11, n:, pp:80-101 [Journal ] Sheila A. Greibach Formal parsing systems. [Citation Graph (0, 0)][DBLP ] Commun. ACM, 1964, v:7, n:8, pp:499-504 [Journal ] Seymour Ginsburg , Sheila A. Greibach Mappings which Preserve Context Sensitive Languages [Citation Graph (0, 0)][DBLP ] Information and Control, 1966, v:9, n:6, pp:563-582 [Journal ] Seymour Ginsburg , Sheila A. Greibach Deterministic Context Free Languages [Citation Graph (0, 0)][DBLP ] Information and Control, 1966, v:9, n:6, pp:620-648 [Journal ] Sheila A. Greibach The Undecidability of the Ambiguity Problem for Minimal Linear Grammars [Citation Graph (0, 0)][DBLP ] Information and Control, 1963, v:6, n:2, pp:119-125 [Journal ] Sheila A. Greibach Full AFLs and Nested Iterated Substitution [Citation Graph (0, 0)][DBLP ] Information and Control, 1970, v:16, n:1, pp:7-35 [Journal ] Sheila A. Greibach Characteristic and Ultrarealtime Languages [Citation Graph (0, 0)][DBLP ] Information and Control, 1971, v:18, n:1, pp:65-98 [Journal ] Sheila A. Greibach Erasing in Context-Free AFLs [Citation Graph (0, 0)][DBLP ] Information and Control, 1972, v:21, n:5, pp:436-465 [Journal ] Sheila A. Greibach Erasable Context-Free Languages [Citation Graph (0, 0)][DBLP ] Information and Control, 1975, v:29, n:4, pp:301-326 [Journal ] Sheila A. Greibach Visits, Crosses, and Reversals for Nondeterministic Off-Line Machines [Citation Graph (0, 0)][DBLP ] Information and Control, 1978, v:36, n:2, pp:174-216 [Journal ] Sheila A. Greibach Comments on Universal and Left Universal Grammars, Context-Sensitive Languages, and Context-Free Grammar Forms [Citation Graph (0, 0)][DBLP ] Information and Control, 1978, v:39, n:2, pp:135-142 [Journal ] Sheila A. Greibach Linearity is Polynomially Decidable for Realtime Pushdown Store Automatia [Citation Graph (0, 0)][DBLP ] Information and Control, 1979, v:42, n:1, pp:27-37 [Journal ] Emily P. Friedman , Sheila A. Greibach On Equivalence and Subclass Containment Problems for Deterministic Context-Free Languages. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1978, v:7, n:6, pp:287-290 [Journal ] José D. P. Rolim , Sheila A. Greibach On the IO-Complexity and Approximation Languages. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1988, v:28, n:1, pp:27-31 [Journal ] José D. P. Rolim , Sheila A. Greibach A Note on the Best-Case Complexity. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1989, v:30, n:3, pp:133-138 [Journal ] Ronald V. Book , Sheila A. Greibach The Independence of Certain Operations on semiAFLS. [Citation Graph (0, 0)][DBLP ] ITA, 1978, v:12, n:4, pp:- [Journal ] Sheila A. Greibach A Note on the Recognition of One Counter Languages. [Citation Graph (0, 0)][DBLP ] ITA, 1975, v:9, n:2, pp:5-12 [Journal ] Sheila A. Greibach A Note on NSPACE(log2 n ) and Substitution. [Citation Graph (0, 0)][DBLP ] ITA, 1977, v:11, n:2, pp:127-132 [Journal ] Sheila A. Greibach The strong independence of substitution and homomorphic replication. [Citation Graph (0, 0)][DBLP ] ITA, 1978, v:12, n:3, pp:- [Journal ] Sheila A. Greibach One counter languages and the chevron operation. [Citation Graph (0, 0)][DBLP ] ITA, 1979, v:13, n:2, pp:- [Journal ] Sheila A. Greibach , Celia Wrathall Single-Tape Reset Machines. [Citation Graph (0, 0)][DBLP ] ITA, 1986, v:20, n:1, pp:55-77 [Journal ] Seymour Ginsburg , Sheila A. Greibach Multitape AFA. [Citation Graph (0, 0)][DBLP ] J. ACM, 1972, v:19, n:2, pp:193-221 [Journal ] Seymour Ginsburg , Sheila A. Greibach , Michael A. Harrison Stack automata and compiling. [Citation Graph (0, 0)][DBLP ] J. ACM, 1967, v:14, n:1, pp:172-201 [Journal ] Seymour Ginsburg , Sheila A. Greibach , Michael A. Harrison One-way stack automata. [Citation Graph (0, 0)][DBLP ] J. ACM, 1967, v:14, n:2, pp:389-418 [Journal ] Sheila A. Greibach The Unsolvability of the Recognition of Linear Context-Free Languages. [Citation Graph (0, 0)][DBLP ] J. ACM, 1966, v:13, n:4, pp:582-587 [Journal ] Sheila A. Greibach An Infinite Hierarchy of Context-Free Languages. [Citation Graph (0, 0)][DBLP ] J. ACM, 1969, v:16, n:1, pp:91-106 [Journal ] Sheila A. Greibach , Emily P. Friedman Superdeterministic PDAs: A Subcase with a Decidable Inclusion problem. [Citation Graph (0, 0)][DBLP ] J. ACM, 1980, v:27, n:4, pp:675-700 [Journal ] Ronald V. Book , Sheila A. Greibach , Oscar H. Ibarra , Ben Wegbreit Tape-Bounded Turing Acceptors and Principal AFLs. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1970, v:4, n:6, pp:622-625 [Journal ] Ronald V. Book , Sheila A. Greibach , Ben Wegbreit Time- and Tape-Bounded Turing Acceptors and AFLs. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1970, v:4, n:6, pp:606-621 [Journal ] Ronald V. Book , Sheila A. Greibach , Celia Wrathall Reset Machines. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1979, v:19, n:3, pp:256-276 [Journal ] Emily P. Friedman , Sheila A. Greibach Monadic Recursion Schemes: The Effect of Constants. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1979, v:18, n:3, pp:254-266 [Journal ] Emily P. Friedman , Sheila A. Greibach Superdeterministic DPDAS: The Method for Accepting Does Affect Decision Problems. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1979, v:19, n:1, pp:79-117 [Journal ] Seymour Ginsburg , Sheila A. Greibach Principal AFL. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1970, v:4, n:4, pp:308-338 [Journal ] Seymour Ginsburg , Sheila A. Greibach On AFL Generators for Finitely Encoded AFA. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1973, v:7, n:1, pp:1-27 [Journal ] Seymour Ginsburg , Jonathan Goldstine , Sheila A. Greibach Uniformly Erasable AFL. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1975, v:10, n:2, pp:165-182 [Journal ] Sheila A. Greibach Syntactic Operators on Full SemiAFLs. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1972, v:6, n:1, pp:30-76 [Journal ] Sheila A. Greibach One Counter Languages and the IRS Condition. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1975, v:10, n:2, pp:237-247 [Journal ] Sheila A. Greibach Control Sets of Context-Free Grammar Forms. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1977, v:15, n:1, pp:35-98 [Journal ] Sheila A. Greibach , John E. Hopcroft Scattered Context Grammars. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1969, v:3, n:3, pp:233-247 [Journal ] Ronald V. Book , Sheila A. Greibach Quasi-Realtime Languages. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1970, v:4, n:2, pp:97-111 [Journal ] Jack W. Carlyle , Sheila A. Greibach , Azaria Paz Matching and Spanning in Certain Planar Graphs. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1983, v:16, n:2, pp:159-183 [Journal ] Sheila A. Greibach A Note on Undecidable Properties of Formal Languages. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1968, v:2, n:1, pp:1-6 [Journal ] Sheila A. Greibach Chains of Full AFL's. [Citation Graph (0, 0)][DBLP ] Mathematical Systems Theory, 1970, v:4, n:3, pp:231-242 [Journal ] Emily P. Friedman , Sheila A. Greibach A Polynomial Time Algorithm for Deciding the Equivalence Problem for 2-Tape Deterministic Finite State Acceptors. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1982, v:11, n:1, pp:166-183 [Journal ] Sheila A. Greibach Jump PDA's and Hierarchies of Deterministic Context-Free Languages. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1974, v:3, n:2, pp:111-127 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] SIGMOD Record, 2005, v:34, n:1, pp:5-12 [Journal ] Sheila A. Greibach A Remark on Code Sets and Context-Free Languages. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1975, v:24, n:7, pp:741-742 [Journal ] Seymour Ginsburg , Jonathan Goldstine , Sheila A. Greibach Some Uniformly Erasable Families of Languages. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1976, v:2, n:1, pp:29-44 [Journal ] Sheila A. Greibach Remarks on the Complexity of Nondeterministic Counter Languages. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1976, v:1, n:4, pp:269-288 [Journal ] Sheila A. Greibach One Way Finite Visit Automata. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1978, v:6, n:, pp:175-221 [Journal ] Sheila A. Greibach Remarks on Blind and Partially Blind One-Way Multicounter Machines. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1978, v:7, n:, pp:311-324 [Journal ] Search in 0.127secs, Finished in 0.130secs