CrossRef 2017

On reduction of automata in labyrinths

Goran Kilibarda

Abstrak

It is shown that every automaton acceptable for rectangular labyrinths can be reduced to an automaton that behaves according to either the left-hand rule or the right-hand rule, or does not move at all, in every plane rectangular labyrinth without leaves. This enables us to approach certain fundamental problems of the theory of automata in labyrinths in a quite different way.

Penulis (1)

Goran Kilibarda

Format Sitasi

APA MLA BibTeX

Kilibarda, G. (2017). On reduction of automata in labyrinths. https://doi.org/10.2298/pim1715047k

Akses Cepat

PDF tidak tersedia langsung

Cek di sumber asli →

Lihat di Sumber doi.org/10.2298/pim1715047k

Informasi Jurnal

Tahun Terbit: 2017
Bahasa: en
Sumber Database: CrossRef
DOI: 10.2298/pim1715047k
Akses: Terbatas