CONTENTS OF VOLUME 10, NUMBER 1-2, 1991

•   Brian D. Bunday: Analysis of the SCAN service polling model, 1-14.

•   J. Csirik, J.B.G. Frenk, M. Labb, S. Zhang: Heuristic for the 0-1 Min-Knapsack Problem, 15-20.

•   G.Galambos: A 1.6 lower-bound for the two-dimensional on-line rectange bin-packing, 21-24.

•   Nguyen Huong Lam, Do Long Van: On strict codes, 25-34.

•   I. Litovsky: Free submonoids and minimal omega-generators, 35-44.

•   A. Mateescu: Special Families of Matrix Languages and Decidable Problems, 45-52.

•   A. Nagy: Boolean-type retractable automata with traps, 53-64.

•   Gh. Paun, S. Vicolov : Language representations starting from fully initial languages, 65-70.

•   J. Sztrik : Modelling of heterogeneous multiprocessor systems with randomly changing parameters, 71-84.

•   J. Sztrik, L. Lukashuk : Modelling of a communication system evolving in a random environment, 85-92.

•   V.D. Thi, N.K. Anh : Weak dependencies in the relational datamodel, 93-100.

•   R. Tindell : Covering Morphisms and Unique Minimal D -Schemes, 101-112.

•   S. Vicolov : A note on fully initial grammars, 113-118.