Acta Cybernetica, Volume 8

Volume 8, 1987

• Stephen L. Bloom, Ralph Tindell: A note on zero-congruences. 1-4
• János Csirik, Gábor Galambos: On the expected behaviour of the NF algorithm for a dual bin-packing problem. 5-9
• V. B. Kudryavtsev: On the supplement of sets in functional systems. 11-26
• Béatrice Bérard: Formal properties of literal shuffle. 27-39
• Zoltán Ésik, J. Virágh: A note on alpha₀^* - products of aperiodic automata. 41-43
• Zoltán Ésik: Loop products and loop-free products. 45-48
• Zoltán Fülöp, Sándor Vágvölgyi: Results on compositions of deterministic root-to-frontier tree transformations. 49-61
• Imreh Neumüller: The invertibility of tree transducers. 63-78
• Tibor Gyimóthy, János Toczki: Syntactic pattern recognition in the HLP/PAS system. 79-88
• Günter Riedewald, Peter Forbrig: Software specification mehtods and attribute grammars. 89-117
• Zoltán Ésik: On isomorphic realization of automata with alphaⁱ-products. 119-127
• Ferenc Gécseg, Balázs Imreh: On isomorphic metric equivalence of nuⁱ. 129-134
• Masashi Katsura: On a problem of Ádám concerning procodes assigned to finite Moore automata. 143-151
• Sándor Vágvölgyi, Zoltán Fülöp: An infinite hierarchy of tree transformations in the cals NDR. 153-168
• Alexander Meduna: Evaluated grammars. 169-176
• N. H. Chien: EBE: a language for specifying the expected bebavior of programs during debugging. 177-190
• H. Thuman: Some remarks on the algorithm of Lucchesi ad Osborn. 191-193
• Vu Duc Thi: Strong dependencies and s-semilattices. 195-202
• Miklós Bartha: A finite axiomatization of flowchart schemes. 203-217

Volume 8, 1988

• Jürgen Dassow: Pure languages of regulated rewriting and their codings. 227-235
• Alexander Meduna, Gy. Horváth: On state grammars. 237-245
• Balázs Imreh: A note on the generalized nuⁱ-product. 247-252
• Pál Dömösi, Zoltán Ésik: On the hiearchy of nuⁱ-product. 253-257
• Sándor Vágvölgyi, Zoltán Fülöp: On ranges of compositions of deterministic root-to-frontier tree transformations. 259-266
• O. Selesnjew, Bernhard Thalheim: On the numbers of shortes keys in relational databases on non-uniform domains. 267-271
• János Demetrovics, Vu Duc Thi: Some results about functional dependencies. 273-278
• János Demetrovics, Vu Duc Thi: Relations and mimimal keys. 279-285
• Zoltán Daróczy, L. Varga: A new approach to defining software complexity measures. 287-291
• Dang Van Hung, Elöd Knuth: A nouinterleaving semantics for communicating sequential processes: a fixed-point approach. 293-314
• Pál Dömösi, Zoltán Ésik: On homomorphic simulation of automata by alphaⁱ-producst. 315-323
• Boris B. Kloss: On minimal antonomous partitions of directed graphs and some applications to atuomata theory. 325-339
• A. S. Podkolzin, S. M. Uscumlic: An approach to automata schmes systhesis. 341-352
• Brian D. Bunday, Esmaile Khorram: The finite source queueing model for ultiprogrammed computer systems with different CPU times and different I/O times. 353-359
• Tibor Csendes: Nonlinear Parameter Estimation by Global Opitmization - Efficiency and reliability. 361-372