Type | Title | Author | Publisher | Year | ||
---|---|---|---|---|---|---|
Article | One-Way Stack Automata | Ginsburg, S., Greibach, S.A., Harrison, M.A. | 1967 | |||
Article | Stack Automata and Compiling | Ginsburg, S., Greibach, S.A., Harrison, M.A. | 1967 | |||
Article | The solvability of machine mappings of regular sets to regular sets | Ginsburg, S., Hibbard, T.N. | 1962 | |||
Article | Two-way Balloon Automata and AFL | Ginsburg, S., Hopcroft, J. | 1970 | |||
Article | Strict Interpretations of Deterministic Pushdown Acceptors | Ginsburg, S., Kintala, C.M.R. | 1981 | |||
Article | On Strict Interpretations of Grammar Forms | Ginsburg, S., Leong, B., Mayer, O., Wotschke, D. | 1979 | |||
Article | On Quasi-Interpretations of Grammar Forms | Ginsburg, S., Maurer, H.A. | 1977 | |||
Article | On Strongly Equivalent Context-Free Grammar Forms | Ginsburg, S., Maurer, H.A. | 1976 | |||
Article | A Mathematical Model of Transformational Grammars | Ginsburg, S., Partee, B. | 1969 | |||
Article | Two families of languages related to ALGOL | Ginsburg, S., Rice, H.G. | 1962 | |||
Article | Some Recursively Unsolvable Problems in ALGOL-Like Languages | Ginsburg, S., Rose, G.F. | 1963 | |||
Article | Operations which preserve definability in languages | Ginsburg, S., Rose, G.F. | 1963 | |||
Article | On the Periodicity of Word-Length in D0L Languages | Ginsburg, S., Rovan, B. | 1974 | |||
Article | Pushdown Acceptor Forms | Ginsburg, S., Spanier, E.H. | 1977 | |||
Article | Pushdown acceptor forms | Ginsburg, S., Spanier, E.H. | 1977 | |||
Article | Quotients of Context-Free Languages | Ginsburg, S., Spanier, E.H. | 1963 | |||
Article | Ambiguity in Context Free Languages | Ginsburg, S., Ullian, J. | 1964 | |||
Article | Precedence Relations in Grammar Forms | Ginsburg, S., Wood, D. | 1978 | |||
Article | Descriptional Complexity of Machines with Limited Resources | Goldstine, J., Kappes, M., Kintala C.M.R, Leung, H., Malcher, A., Wotschke, D. | 2002 | |||
Article | On the relation between ambiguity and nondeterminism in finite automata | Goldstine, J., Leung, H., Wotschke, D. | 1992 | |||
Article | On reducing the number of states in a PDA | Goldstine, J., Price, J.K., Wotschke, D. | 1981 | |||
Article | A pushdown automton or acontext-free grammar which is more economical? | Goldstine, J., Price, J.K., Wotschke, D. | 1981 | |||
Article | Grammatical constructions in selective substitution grammars | Gonczarowski, J., Keijn, H.C.M., Rozenberg, G. | 1983 | |||
Article | Grammatical constructions in selective substitution grammars | Gonczarowski, J., Keijn, H.C.M., Rozenberg, G. | 1983 | |||
Article | Closure properties of selective substitution grammars | Gonczarowski, J., Kleijn, H.C.M., Rozenberg, G. | 1983 | |||
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 |