| Type | Title | Author | Publisher | Year |
| Article | Non-uniform automata over groups | Barrington, D.A.M., Straubing, H., Therien, D. | | 1990 |
| Article | On ground-confluences of term rewriting systems | Kapur, D., Narendran, P., Otto, F. | | 1990 |
| Article | Distributed/Cooperative Office | Csaba, L., Csuhaj-Varju, E. | | 1990 |
| Article | On structured graph grammars: II | Kreowski, H.-J., Rozenberg, G. | | 1990 |
| Article | Reducing Operators for Generalized Grammars | Novotny, M. | | 1990 |
| Article | On Superreducts | Novotny, M., Pawlak, Z. | | 1990 |
| Article | Soliton automata | Dassow, J., Jurgensen, H. | | 1990 |
| Article | On structured graph grammars: I | Kreowski, H.-J., Rozenberg, G. | | 1990 |
| Article | Data types over multiple-valued logics | Pigozzi, D. | | 1990 |
| Article | Pipelining tree-structured algorithms on simd architectures | Barnard, D.T., Skillicorn, D.B. | | 1990 |
| Article | Context free derivations on word monoids | Meduna, A. | | 1990 |
| Article | A completeness theorem for kleene algebras and the algebra of regular events | Kozen, D. | | 1990 |
| Article | Collage Grammars | Habel, A., Kreowski, H.-J. | | 1991 |
| Article | Complete systems of B-rational identities in TCS volume 89, no. 2 | Krob, D. | | 1991 |
| Article | Which Kleene semigroups are finite? | Rupert, C.P. | | 1991 |
| Article | Uniform algebraic specifications of finite sets with equality | Bergstra, J.A., Mauw, S., Wiedijk, F. | | 1991 |
| Article | Deterministic soliton automata with a single exterior node | Dassow, J., Jurgensen, H. | | 1991 |
| Article | Logic hypergraph grammars and context-free hypergraph grammars | Shioya, I., Nakamura, K. | | 1991 |
| Article | On multiple context-free grammars | Seki, H., Matsumura, T., Fujii, M., Kasami, T. | | 1991 |
| Article | Operating System Concepts | Silberschatz, A., Peterson, J., Galvin, P. | | 1991 |
| Article | Overlaps in free partially commutative monoids | Otto, F., Wrathall, C. | | 1991 |
| Article | Hypermap rewriting: a combinatorial approach | Sopena, E. | | 1991 |
| Article | On the connectedness of pictures in chain code pisture languages | Dassow, J. | | 1991 |
| Article | Nonacceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata | Fachini, E., Schenttini, A.M., Resta, G., Sangiorgi, D. | | 1991 |
| Article | Context-free parsing on O(n) processors | Barnard, D.T., Skillicorn, D.B. | | 1991 |
| 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 |
