Reduction of Automata in Labyrinths and Universal Traps

Goran Kilibarda

We consider the problem of searching labyrinths by collectives of independent automata and show that for such collectives it is possible to construct, by using reduction of automata, traps of various types even in the class of all finite mosaic labyrinths.