Acta Cybernetica, Volume 8

Volume 8, 1987

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

Volume 8, 1988

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