|
|
|
Volume 10, Numbers 1-2, 1991
-
Brian D. Bunday.
Analysis of the SCAN service polling model.
Acta Cybernetica,
10(1--2):1-13,
1991.
[ PDF ]
-
János Csirik,
J. B. G. Frenk,
M. Labbé,
and S. Zhang.
Heuristics for the 0-1 Min-Knapsack Problem.
Acta Cybernetica,
10(1-2):15-20,
1991.
[ PDF ]
-
Gábor Galambos.
A 1.6 lower-bound for the two-dimensional on-line rectangle bin-packing.
Acta Cybernetica,
10(1-2):21-24,
1991.
[ PDF ]
-
Nguyen Huong Lam and Do Long Van.
On strict codes.
Acta Cybernetica,
10(1-2):25-34,
1991.
[ PDF ]
-
Igor Litovsky.
Free submonoids and minimal $\omega$-generators of $R^{\omega}$.
Acta Cybernetica,
10(1-2):35-43,
1991.
[ PDF ]
-
A. Mateescu.
Special Families of Matrix Languages and Decidable Problems.
Acta Cybernetica,
10(1-2):45-51,
1991.
[ PDF ]
-
A. Nagy.
Boolean-type retractable automata with traps.
Acta Cybernetica,
10(1-2):23-64,
1991.
[ PDF ]
-
Gh. Paun and S. Vicolov.
Language representations starting from fully initial languages.
Acta Cybernetica,
10(1-2):65-70,
1991.
[ PDF ]
-
J. Sztrik.
Modelling of heterogeneous multiprocessor systems with randomly changing parameters.
Acta Cybernetica,
10(1-2):71-84,
1991.
[ PDF ]
-
J. Sztrik and L. Lukashuk.
Modelling of a Communication System Evolving in a Random Environment.
Acta Cybernetica,
10(1-2):85-91,
1991.
[ PDF ]
-
V. D. Thi and N. K. Anh.
Weak dependecnies in the relational datamodel.
Acta Cybernetica,
10(1-2):93-100,
1991.
[ PDF ]
-
R. Tindell.
Covering Morphisms and Unique Minimal D-Schemes.
Acta Cybernetica,
10(1-2):101-112,
1991.
[ PDF ]
-
S. Vicolov.
A note on fully initial grammars.
Acta Cybernetica,
10(1-2):113-118,
1991.
[ PDF ]
This document was translated from BibTEX by
bibtex2html
|
|
|