Vol. 10 No. 1-2 (1991)

Regular articles

• Heuristics for the 0-1 min-knapsack problem

  János Csirik, J. B. G. Frenk, M. Labbé, S. Zhang

  15-20

  • PDF

• Boolean-type retractable automata with traps

  Attila Nagy

  53-64

  • PDF

• Covering morphisms and unique minimal D-schemes

  Ralph Tindell

  101-112

  • PDF

• Free submonoids and minimal ω-generators of Rω

  Igor Litovsky

  35-43

  • PDF

• Modelling of a communication system evolving in a random environment

  János Sztrik, L. I. Lukashuk

  85-91

  • PDF

• A 1.6 lower-bound for the two-dimensional on-line rectangle bin-packing

  Gábor Galambos

  21-24

  • PDF

• Language representations starting from fully initial languages

  Gheorghe Păun, Sorina Vicolov

  65-70

  • PDF

• A note on fully initial grammars

  Sorina Vicolov

  113-118

  • PDF

• Analysis of the SCAN service polling model

  Brian D. Bunday

  1-13

  • PDF

• Special families of matrix languages and decidable problems

  Alexandru Mateescu

  45-51

  • PDF

• Weak dependecnies [!dependencies] in the relational datamodel

  Vu Duc Thi, N. K. Anh

  93-100

  • PDF

• On strict codes

  Huong Lam Nguyen, Do Long Van

  25-34

  • PDF

• Modelling of heterogeneous multiprocessor systems with randomly changing parameters

  János Sztrik

  71-84

  • PDF