Acta Cybernetica, Volume 9

Volume 9, Number 1, 1989

Vladimir V. Anisimov, János Sztrik: Asymptotic analysis of some controlled finite-source queuing systems. 27-38
Ralph P. Tucci: A Decomposition Theorem for a class of infinite transformation semigroups. 39-54
Éva Gombás, Miklós Bartha: Two transformations on attribute grammars improving the complexity of their evaluation. 55-72
Le Van Bao, Ho Thuan: Key ad superkey for a closure function. 73-88

János Csirik, Balázs Imreh: On the worst-case performance of the NkF bin-packing heuristic. 89-105
Ulrich Faigle, Walter Kern, György Turán: On the performance of on-line algorithms for partition problems. 107-119
Attila Kuba: Determination of the structure of the class (R, S) of (0, 1)-matrices. 121-132
R. Alvarez Gil, Á. Makay: Parallel programming structures and attribute grammars. 133-141
Alexandru Mateescu, Gheorghe Paun: On fully initial grammars with regulated rewriting. 157-165
Ferenc Gécseg, Balázs Imreh: On star-product of automata. 167-172
Genjiro Tanaka: On characteristic semigroups of Mealy automata. 173-177

Reino Kurki-Suonio: Towards languages that support program derivation, or control modularity considered harmful. 179-192
Kai Koskimies: Techniques for Modular language implementation. 193-200
Jukka Paakki, Kori Toppola: An error - recovering from of DCGs. 212-221
Matti O. Jokinen: Uniform approach to parameter transmission mechanisms, coercions, optional parameters and patterns. 223-233
Pekka Kilpeläinen, Heikki Mannila: Generation of test cases for simple prolog programs. 235-246
Zoltán Alexin, József Dombi, Károly Fábricz, Tibor Gyimóthy: A natural language interface based on attribute grammars. 247-255
Ágnes Hernádi, A. Heppes, Elöd Knuth: Data pictures on the desktop. 257-268
Harri Laine: YYY - A database design tool. 269-280
Solly Wagner-Dibuz: Frames for protocal description. 281-289
M. Aspnäs, Ralph-Johan Back: A programming environment for a transputer-based multiprocessor system. 291-301
Aimo A. Törn: PICA - A graphical program development tool. 303-321
István Forgács, Attila Horváth, Endre Somos: MICROTEST - A testing tool on PC. 323-332

A. Arnold: Recognizable sets of finite bilabelled transition systems. 333-347
Virgil Emil Cazanescu, Gheorghe Stefanescu: A note on axiomatizing flowchart schemes. 349-359
János Csirik, J. B. G. Frenk, Martine Labbé, Shuzhong Zhang: On the multidimensional vector bin packing. 361-369
Pál Dömösi, Zoltán Ésik: Product hierarchies of automata and homomorphic simulation. 371-373
Zoltán Ésik: A note on the axiomatization of iteration theories. 375-384
Georg Gottlob, Leonid Libkin: Investigation on Armstrong relations, dependency inference, and excluded functional dependencies. 385-402
Craig A. Rich, Giora Slutzki: The complexity of a counting finite-state automation. 403-417
Arto Salomaa: Decision problems arising from knapsack transformations. 419-440
Bernhard Thalheim, E. Al-Fedhagi: Preserving two-tuple dependencies under projection. 441-458