CrossRef 2021

Reduction of automata in labyrinths and universal traps

Goran Kilibarda

Abstrak

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.

Penulis (1)

Goran Kilibarda

Format Sitasi

APA MLA BibTeX

Kilibarda, G. (2021). Reduction of automata in labyrinths and universal traps. https://doi.org/10.2298/pim2123017k

Akses Cepat

PDF tidak tersedia langsung

Cek di sumber asli →

Lihat di Sumber doi.org/10.2298/pim2123017k

Informasi Jurnal

Tahun Terbit: 2021
Bahasa: en
Sumber Database: CrossRef
DOI: 10.2298/pim2123017k
Akses: Terbatas