Abstract
We consider the problem of searching labyrinths by colletives of independent automata and show that for such colletives it is possible to construct, by using reduction of automata, traps of various types even in the class of all finite mosaic labyrinths.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Publications de l'Institut Math?matique (Belgrade)
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
