Regular articles

• A form of the Zermelo—von Neumann theorem under minimal assumptions

  Béla Csákány

  321-325

  • PDF
• Automaton theory approach for solving modified PNS problems

  Balázs Imreh

  327-338

  • PDF
• Factorizations of languages and commutativity conditions

  Alexandru Mateescu, Arto Salomaa, Sheng Yu

  339-351

  • PDF
• Reduction of simple semi-conditional grammars with respect to the number of conditional productions

  Alexander Meduna, Martin Švec

  353-360

  • PDF
• Closed on-line bin packing

  Eyjólfur Ingi Asgeirsson

  361-367

  • PDF
• A PTAS for single machine scheduling with controllable processing times

  Petra Schuur, Gerhard J. Woeginger

  369-378

  • PDF
• An arithmetic theory of consistency enforcement

  Sebastian Link, Klaus-Dieter Schewe

  379-416

  • PDF
• Definition of a parallel execution model with abstract state machines

  Zsolt Németh

  417-455

  • PDF
• Properties of composite of closure operations and choice functions

  Nghia D. Vu, Bina Ramamurthy

  457-465

  • PDF
• The home marking problem and some related concepts

  Roxana Melinte

  467-478

  • PDF