Vol. 21 No. 3 (2002): Computing and Informatics

Articles

• On the logical definability of topologically closed recognizable languages of infinite trees

  David Janin, Giacomo Lenzi

  185-203

• Automatic finding of good classifiers following a biologically inspired metaphor

  Fernando Fernández, Pedro Isasi

  205-220

• Hypermedia systems modelling framework

  Peter Dolog, Mária Bieliková

  221-239

• The reconstruction of polyominoes from approximately orthogonal projections

  Maciej Gębala

  241-249

• Fuzzy Turing machines revised

  Jiří Wiedermann

  251-263

• Efficient deadlock-free multidimensional interval routing in hypercube-like networks

  Rastislav Královič, Branislav Rovan, Peter Ružička, Daniel Štefankovič

  265-287