
L. Varga:
On the verification of abstract data types. 7-12
L. Borzemski:
Data structures and storage structures in scientific data base for multistage experiment. 13-21
Hans Kleine Büning:
The early bird problem is unsolvable in one-dimensional cellular space with 4 states. 23-31
Josef Pecht:
On the real-time recognition of formal languages in cellular automata. 33-53
Pál Dömösi:
On homomorphically alphai-complete systems of automata. 85-88
János Sztrik:
Probability model for non-homogeneous multiprogramming computer system. 93-101
Th. Fischer:
Das Prinzip der maximalen Entropie und seine Anwendung in der Codierungsund Suchttheorie. 103-110
Ana Pasztor:
Epis of some categories of Z-continuous partial algebras. 111-123
Miklós Bartha:
Linear deterministic attributed transformations. 125-147
Zoltán Fülöp:
Decomposition results concerning K-visit attributed tree transducers. 163-171
Ferenc Gécseg:
On a representation of deterministic uniform foot-to frontier tree transformations. 173-180
M. Arató:
Run length control in simulations and performance evaluation and elementary Gaussian processes. 203-212
P. Ecsedi-Tóth:
A theory of finite functions, Part I., On finite trees associated to certain finite functions. 213-225
B. Csákány:
All minimal clones on the three-element set. 227-238
J. Virágh:
Deterministic ascending tree automata II. 291-301
Zoltán Ésik:
Decidability results concerning tree transducers II. 303-314
András Ádám:
On certain partitions of finite directed graphs and of finite automata. 331-346
Miklós Bartha:
On injective attributed characterization of 2-way deterministic finite state transducers. 347-353
Jürgen Dassow:
On some extensions of Russian parallel context free grammars. 355-360
Cs. Puskás:
A new method for the analysis and synthesis of finite Mealy-automata. 361-369
László Szabó:
On the lattice of clones acting bicentrally. 381-388