Regular articles

• A criterion for the simplicity of finite Moore automata

  András Ádám

  221-236

  • PDF
• On a special composition of tree automata

  Balázs Imreh

  237-242

  • PDF
• Regularizing context-free languages by AFL operations : concatenation and Kleene closure

  Jürgen Dassow

  243-253

  • PDF
• The Boolean closure of DR-recognizable tree languages

  Eija Jurvanen

  255-272

  • PDF
• A queuing model for a processor-shared multi-terminal system subject to breakdowns

  B. Almási

  273-282

  • PDF
• The self-organizing list and processor problems under randomized policies

  T. Makjamroen

  283-302

  • PDF
• Computing maximum valued regions

  Gerhard J. Woeginger

  303-315

  • PDF
• On the Boolean structure of fuzzy logical systems : a counter example

  József Dombi, Gy. Lencsés

  317-322

  • PDF
• On minimal and maximal clones

  László Szabó

  323-327

  • PDF