Regular articles

• A uniform approach to test computational complementarity

  Elena Calude, Bruce Mills, Lan Mills

  367-384

  • PDF
• Two-way metalinear PC grammar systems and their descriptional complexity

  Alexander Meduna

  385-397

  • PDF
• Retractable state-finite automata without outputs

  Attila Nagy

  399-409

  • PDF
• Relationally defined clones of tree functions closed under selection or primitive recursion

  Reinhard Pöschel, Aleksander Semigrodskij, Heiko Vogler

  411-425

  • PDF
• Notes on the properties of dynamic programming used in direct load control

  Isto Aho

  427-441

  • PDF
• On computing the Hamming distance

  Gerzson Kéri, Ákos Kisvölcsey

  443-449

  • PDF
• The recycled Kaplansky's game

  András Pluhár

  451-458

  • PDF
• Distance functional dependencies in the presence of complex values

  Sebastian Link, Klaus-Dieter Schewe

  459-472

  • PDF
• Some problems related to keys and the Boyce-Codd normal form

  Vu Duc Thi, Hoang Son Nguyen

  473-483

  • PDF
• Relationships between closure operations and choice functions - equivalent descriptions of a family of functional dependencies

  Nghia D. Vu

  485-506

  • PDF