| Type | Title | Author | Publisher | Year |
| Article | Properties of finite and pushdown transducers | Choffrut, C., Culik II, K. | | 1983 |
| Article | Systems of equations over a free monoid and Ehrenfeucht's conjecture | Culik II, K., Karhumaki, J. | | 1983 |
| Article | On binary equality sets and a solution to the test set conjecture in the binary case | Ehrenfeucht, A., Karhumaki, J, Rozenberg, G. | | 1983 |
| Article | Closure properties of selective substitution grammars | Gonczarowski, J., Kleijn, H.C.M., Rozenberg, G. | | 1983 |
| Article | Selective substitution grammars based on context-free productions | Kleijn, J. | | 1983 |
| Article | Languages defined by semi-thue and regular systems | Kudlek, M. | | 1983 |
| Article | Folding of the plane and the design of systolic arrays | Choffrut, C., Culik II, K. | | 1983 |
| Article | Testing for grammatical coverings | Rozenkrantz, D.J., Hunt, H.B. | | 1983 |
| Article | Closure properties of selective substitution grammars | Gonczarowski, J., Kleijn, H.C.M., Rozenberg, G. | | 1983 |
| Article | Kontextfrei kontrollierte ET0L-systeme | Lange, K.-J. | | 1983 |
| Article | Systolic automata for VLSI on balanced trees | Culik II, K., Gruska, J., Salomaa, A. | | 1983 |
| Article | D0L schemes and the periodicity of string embeddings | Head, T., Thierrin, G., Wilkinson, J. | | 1983 |
| Article | Systolic tree and trellis automata | Salomaa, A. | | 1983 |
| Article | Comparison of some types of regulated rewriting | Dassow, J. | | 1983 |
| Article | Two-symbol D0S systems generating regular languages | Bucher, W. | | 1983 |
| Article | X-grammars | Kornai, A. | | 1983 |
| Article | It is decidable whether a regular language is pure context-free | Bucher, W., Hagauer, J. | | 1983 |
| Article | Descriptional complexity measures of context-free languages | Cerny, A. | | 1983 |
| Article | Two-symbols D0S systems generating regular languages | Bucher, W. | | 1983 |
| Article | A fuzzy-set-theoretic approach to the compositionality of meaning: propositions, disporitions and canonical forms | Zadeh, L.A. | | 1983 |
| Article | A Supernormal-Form Theorem for Context-Free Grammars | Maurer, H.A., Salomaa, A., Wood, D. | | 1983 |
| Article | On Extensibility of Unavoidable Sets | Choffrut, C., Culik II, K. | | 1983 |
| Article | It is decidable whether a regular language is pure context-free | Bucher, W., Hagauer, J. | | 1983 |
| Article | Finding Rectangle Intersections | Guting, R.H., Wood, D. | | 1983 |
| Article | Programmable Finite Automata for VLSI | Culik II, K., Jurgensen, H. | | 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 |
