Regular articles

• Recognizable sets of finite bilabelled transition systems

  André Arnold

  333-347

  • PDF
• A note on axiomatizing flowchart schemes

  Virgil Emil Căzănescu, Gheorghe Ştefănescu

  349-359

  • PDF
• On the multidimensional vector bin packing

  János Csirik

  361-369

  • PDF
• Product hierarchies of automata and homomorphic simulation

  Pál Dömösi, Zoltán Ésik

  371-373

  • PDF
• A note on the axiomatization of iteration theories

  Zoltán Ésik

  375-384

  • PDF
• Investigations on Armstrong relations, dependency inference, and excluded functional dependencies

  Georg Gottlob, Leonid O. Libkin

  385-402

  • PDF
• The complexity of a counting finite state automaton

  Craig A. Rich, Giora Slutzki

  403-417

  • PDF
• Decision problems arising from knapsack transformations

  Arto Salomaa

  419-440

  • PDF
• Preserving two-tuple dependencies under projection

  Bernhard Thalheim, Sabah S. Al-Fedaghi

  441-458

  • PDF