| Type | Title | Author | Publisher | Year |
| Article | Symmetric Graphs and Interpretations | Welzl, E. | | 1983 |
| Article | Kontextfrei kontrollierte ET0L-systeme | Lange, K.-J. | | 1983 |
| Article | Closure properties of selective substitution grammars | Gonczarowski, J., Kleijn, H.C.M., Rozenberg, G. | | 1983 |
| Article | Closure properties of selective substitution grammars | Gonczarowski, J., Kleijn, H.C.M., Rozenberg, G. | | 1983 |
| Article | Systolic automata for VLSI on balanced trees | Culik II, K., Gruska, J., Salomaa, A. | | 1983 |
| Article | The role of fuzzy logic in the management of uncertainty in expert systems | Zadeh, L.A. | | 1983 |
| Article | Folding of the plane and the design of systolic arrays | Choffrut, C., Culik II, K. | | 1983 |
| Article | On the Generative Power of Regular Pattern Grammars | Kleijn, H.C., Rozenberg, G. | | 1983 |
| Article | Checking Sets, Test Sets, Rich Languages and Commutative Closed Languages | Albert, J., Wood, D. | | 1983 |
| Article | Towards a General Concept of Hypercodes | Prodinger, H., Thierrin. G. | | 1983 |
| Article | On the equivalence and containment problems for unambiguous regular expressinos, regular grammars, and fintite automata | Stearns, R.E., Hunt, H.B. | | 1983 |
| Article | A fuzzy-set-theoretic approach to the compositionality of meaning: propositions, disporitions and canonical forms | Zadeh, L.A. | | 1983 |
| Article | It is decidable whether a regular language is pure context-free | Bucher, W., Hagauer, J. | | 1983 |
| Article | On a family of L languages resulting from systolic tree automata | Culik II, K., Gruska, J., Salomaa, A. | | 1983 |
| Article | Descriptional complexity measures of context-free languages | Cerny, A. | | 1983 |
| Article | Two-symbols D0S systems generating regular languages | Bucher, W. | | 1983 |
| Article | On Extensibility of Unavoidable Sets | Choffrut, C., Culik II, K. | | 1983 |
| Article | Systolic trees and systolic language recognition by tree automata | Steinby, M. | | 1983 |
| Article | Batched dynamic solutions to decomposable searching problems | Edelsbrunner, H., Overmars, M.H. | | 1983 |
| Article | On covarieties of coalgebras | Marvan, M. | | 1983 |
| Article | A note on the programmed 0L systems | Dassow, J. | | 1983 |
| Article | On the generative power of regular pattern grammars | Kleijn, H.C., Rozenberg, G. | | 1983 |
| Article | It is decidable whether a regular language is pure context-free | Bucher, W., Hagauer, J. | | 1983 |
| Article | A supernormal-form theorem for context-free grammars | Maurer, H.A., Salomaa, A., Wood, D. | | 1983 |
| Article | Finding Rectangle Intersections | Guting, R.H., Wood, D. | | 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 |
