| Type | Title | Author | Publisher | Year |
| Article | Two-tape pushdown automaton in top-down syntax analysis and algebraic aspect of the process | Kopriva, J. | | 1971 |
| Article | A Decomposition Theorem for Convexity Spaces | Rawlins, G.J.E., Wood, D. | | 1989 |
| Article | From Ll-regular to LL(1) grammars: Transformations, covers and parsing | Nijholt, A. | | 1982 |
| Article | Finding Rectangle Intersections | Guting, R.H., Wood, D. | | 1983 |
| Article | A characterization of set representable labeled partial 2-structures through decompositions | Ehrenfeucht, A., Rozenberg, G. | | 1990 |
| Article | The Contour Problem for Polygons | Ottmann, Th., Wood, D. | | 1984 |
| Article | Properties of finite and pushdown transducers | Choffrut, C., Culik II, K. | | 1983 |
| Article | On Efficient Entreeings | Amerins, P.S., Baeza-Yates, R.A., Wood, D. | | 1988 |
| Article | Practical LL(1)-based parsing of van Wijngaarden Grammars | Fisher, A.J. | | 1985 |
| Article | On Extensibility of Unavoidable Sets | Choffrut, C., Culik II, K. | | 1983 |
| Article | Semi-top-down syntactic analysis | Kral, J., Demner, J. | | 1973 |
| Article | Finite-State Transducers in Language and Speech Processing | Mohri, M. | | 1997 |
| Article | New techniques for proving the decidability of equivalence problems | Culik II, K. | | 1990 |
| Article | Pure Grammars with Regulated Rewriting | Dassow, J. | | 1986 |
| Article | Codes and local constraints | Restivo, A. | | 1990 |
| Article | Effective construction of grammars for languages of two particular classes | Ostravsky, J. | | 1985 |
| Article | Weiterfuhrende arbeiten am COMPANET-Compiler: Realisierung der verdeckten Interrechner-Kommunikation im COPANET | Nebel, B. | | 1971 |
| Article | Coordinated pair systems; Part I: Dyck works and classical pumping | Ehrenfeucht, A., Hoogeboom, H.J., Rozenberg, G. | | 1986 |
| Article | Grammatical constructions in selective substitution grammars | Gonczarowski, J., Keijn, H.C.M., Rozenberg, G. | | 1983 |
| Article | Coordinated pair systems; Part II: Sparse structures of Dyck words and Ogden's lemma | Ehrenfeucht, A., Hoogeboom, H.J., Rozenberg, G. | | 1986 |
| Article | On predecessors of finite languages | Maurer, H.A., Salomaa, A., Wood, D. | | 1981 |
| Article | Finitary and Infinitary Interpretations of Languages | Maurer, H.A., Salomaa, A., Wood, D. | | 1982 |
| Article | The ultimate equivalence of iterated homomorphisms is recursively unsolvable | Karpinski, M. | | 1980 |
| Article | On form-equivalence of deterministic pure grammar forms | Hagauer, J. | | 1982 |
| Article | Code properties and homomorphisms of D0L systems | Head, T., Wilkinson, J. | | 1985 |
| 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 |
