Vol. 5 No. 1 (1980)

Regular articles

• d-dependency structures in the relational model of data

  Gábor Czédli

  49-57

  • PDF

• Deterministic ascending tree automata I

  János Virágh

  33-42

  • PDF

• Dominant schedules of a steady job-flow pair

  József Tankó

  87-115

  • PDF

• Decidability results concerning tree transducers I

  Zoltán Ésik

  1-20

  • PDF

• Synthesis of abstract algorithms

  L. Varga

  59-76

  • PDF

• Iterated grammars

  László Csirmaz

  43-47

  • PDF

• On isomorphic representations of commutative automata with respect to αi-products

  Balázs Imreh

  21-32

  • PDF

• On optimal performance in self-organizing paging algorithms

  R. I. Phelps, L. C. Thomas

  77-85

  • PDF