Regular articles

• Mealy-automata in which the output-equivalence is .a congruence

  István Babcsányi, Attila Nagy

  121-126

  • PDF
• Measure of infinitary codes

  Huong Lam Nguyen, Do Long Van

  127-137

  • PDF
• A universal unification algorithm based on unification-driven leftmost outermost narrowing

  Heinz Fassbender, Heiko Vogler

  139-167

  • PDF
• Radical theory for group semiautomata

  Yuen Fong, Feng-Kuo Huang, Richard Wiegandt

  169-188

  • PDF
• Structuring grammar systems by priorities and hierarchies

  Victor Mitrana, Gheorghe Păun, Grzegorz Rozenberg

  189-204

  • PDF
• Normal forms and minimal keys in the relational datamodel

  János Demetrovics, Vu Duc Thi

  205-215

  • PDF
• On strong-generalized positive Boolean dependencies

  Le Thi Thanh

  217-231

  • PDF
• Partitioning graphs into two trees

  Ulrich Pferschy, Gerhard J. Woeginger, En-Yu Yao

  233-240

  • PDF