Acta Cybernetica, Volume 7

Volume 7, Number 1, 1985

Stephen L. Bloom: Frontiers of one-letter languages. 1-18 BibTeX
Éva Gombás, Miklós Bartha: A multi-visti charaterization of absolutely noncircular attribute grammars. 19-31 BibTeX
Rainer Parchmann, Jürgen Duske, Johann Specht: Indexed LL(k) Grammars. 33-53 BibTeX
Ferenc Gécseg: On nvⁱ-products of commutative automata. 55-59 BibTeX
Balázs Imreh: On finite definite automata. 61-65 BibTeX
M. Ito, Jürgen Duske: On involutorial automata and involutorial events. 67-79 BibTeX
Tamás Legendi, Endre Katona: A solution of the early bird problem in an n-dimensional cellular space. 81-87 BibTeX
E. Simon: Language extension in the HLP/SZ system. 89-97 BibTeX
Ho Thuan, Le Van Bao: Some results about key of relational schemas. 99-113 BibTeX
János Sztrik: A queneing model for multiprogrammed computer system with different I/O times. 127-135 BibTeX
László Szabó: Charaterization of clones acting bicentrally and containing a primitive group. 137-145 BibTeX

Zoltán Ésik: On the weak equivalence of Elgot's flow-chart schemata. 147-154 BibTeX
Éva Gombás, Miklós Bartha: Atomic characterizations of uniform multi-pass attributed grammars. 155-172 BibTeX
Z. Zachar: On the equivalence of the frontier-to-root tree transducers I. 173-182 BibTeX
Z. Zachar: On the equivalence of the frontier-to-root tree transducers II. 183-193 BibTeX
K. Peeva: Systems of linear equations over a bounded chain. 195-202 BibTeX
Ferenc Gécseg: Metric representations by nuⁱ-products. 203-209 BibTeX
P. Ecsedi-Tóth: A partial solution of the finite spectrum problem. 211-215 BibTeX
Imre Pávó: The analysis od signal flow graph containing smpled-data elements. 217-223 BibTeX
Ernesto Burattini, G. Marra, A. Sforza: Network design problem: stucture of solutions and dominance relations. 225-239 BibTeX

János Csirik, E. Máté: The probabilistic behaviour of the NEF Bin Packing algorithm. 241-245 BibTeX
Do Long Van: Langages écrits par un code infinitaire. Theérorème du défaut. 247-257 BibTeX
András Ádám: On the congruences of finite autonomous Moore automata. 259-279 BibTeX
Masashi Katsura: On compexity of finite moore automata. 281-292 BibTeX
Zoltán Ésik: Varieties and general products of top-down algebras. 293-298 BibTeX
Zoltán Ésik, J. Virágh: On products of automata with identity. 299-311 BibTeX
József Dombi: Properties of the fuzzy connectives in the light of the general representations theorem. 313-321 BibTeX
A. M. Iványi, A. N. Sotnikow: On the opimization of libray information retrieval systems. 323-328 BibTeX
János Sztrik: A probability model for priority processor-shared multiprogrammed computer systems. 329-340 BibTeX
Andras Szép: an interative method for solving M/G/1/N-type loops with priority queues. 341-354 BibTeX

Stephen L. Bloom: The alternation number and a dot hierarchy of regular sets. 355-358 BibTeX
Vu Duc Thi: Minima keys and antikeys. 361-371 BibTeX
J. Pecht: On the index of concavity of neighbourhood templates. 373-376 BibTeX
A. Varga: Opimization of multi valued logical functions based on evaluation graphs. 377-403 BibTeX
Konrad Engel, Hans-Dietrich O. F. Gronau: An Erös - Ko - Rado Type Theorem II. 405-411 BibTeX
R. Alvarez Gil: Giving mathematical semantics of nondeterministic and paralle programming structures by means of a attributed grammars. 413-423 BibTeX
E. Simon: A new programming mehtodology using attribute grammers. 425-436 BibTeX
Svyatoslav Sergeevich Lavrov: Problem solving based on knowledge representation and program synthesis. 437-441 BibTeX
Sándor Vágvölgyi: On the compositions of root-to-frontier tree tranformations. 443-484 BibTeX