| Type | Title | Author | Publisher | Year |
| Article | Regularity and Transitivity of Local-Automorphism Semigroups of Locally Finite Forests | Blazkova, R., Chvalina, J. | | 1983 |
| Article | Matematika v alternativnoj teorii mnozectv | Vopenka, P. | | 1983 |
| Article | Vyuislivost vvegehue v meoruju rekursivnich funkcii | Katlend, N. | | 1983 |
| Article | Hoare algebras versus dynamic algebras | Wechler, W. | | 1983 |
| Article | Transductions and the parallel generation of languages | Culik II, K., Head, T. | | 1983 |
| Article | The role of fuzzy logic in the management of uncertainty in expert systems | Zadeh, L.A. | | 1983 |
| Article | Batched dynamic solutions to decomposable searching problems | Edelsbrunner, H., Overmars, M.H. | | 1983 |
| Article | Systolic trees and systolic language recognition by tree automata | Steinby, M. | | 1983 |
| Article | On finite grammar forms | Maurer, H.A., Salomaa, A., Wood, D. | | 1983 |
| Article | On covarieties of coalgebras | Marvan, M. | | 1983 |
| Article | A supernormal-form theorem for context-free grammars | Maurer, H.A., Salomaa, A., Wood, D. | | 1983 |
| Article | A note on the programmed 0L systems | Dassow, J. | | 1983 |
| Article | Iterative Tree Automata | Culik II, K., Yu, S. | | 1984 |
| Article | On Bounded Context-free Languages | Latteux, M., Thierrin, G. | | 1984 |
| Article | Metodika programovani a efektivnost vypoctu 1. cast | Kopriva, J. | | 1984 |
| Article | Remarks on the complexity of regulated rewriting | Dassow, J. | | 1984 |
| Article | Denseness, Maximality, and Decidability of Grammatical Families | Maurer, H.A., Salomaa, A., Welzl, E., Wood, D. | | 1984 |
| Article | Symplifying locking in a concurrent environment | Schrapp, M. | | 1984 |
| Article | Metodika programovani a efektivnost vypoctu 2. cast | Kopriva, J. | | 1984 |
| Article | Encoding graphs by derivations and imlications for the theory of graph grammars | Welzl, E. | | 1984 |
| Article | Adherences of D0L languages | Head, T. | | 1984 |
| Article | Some remarks concerning the complexity of sorting and searching in an orthogonal memory | Schneider, H.J. | | 1984 |
| Article | On infinite words obtained by selective substitution grammars | Siromoney, R., Dare, V.R. | | 1984 |
| Article | Iterative Tree Automata | Culik II, K., Yu, S. | | 1984 |
| Article | Context-free complexity of finite languages | Bucher, W., Maurer, H.A., Culik II, K. | | 1984 |
| 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 |
