Kilibarda Goran D

Publications in Math-Net.Ru

1. Type meeting problem for automata in labyrinths
   
   Intelligent systems. Theory and applications, 25:3 (2021),  83–132
2. Collectives of automata in labyrinths
   
   Diskr. Mat., 15:3 (2003),  3–39
3. Independent systems of automata in labyrinths
   
   Diskr. Mat., 15:2 (2003),  3–39
4. On the number of Boolean functions in the Post classes $F_8^\mu$
   
   Diskr. Mat., 11:4 (1999),  127–138
5. On the minimal universal collectives of automata for plane labyrinths
   
   Diskr. Mat., 6:4 (1994),  133–153
6. On the complexity of traversing labyrinths by an automaton
   
   Diskr. Mat., 5:3 (1993),  116–124
7. Labyrinth traps for groups of automata
   
   Diskr. Mat., 5:2 (1993),  29–50
8. The behavior of automata in labyrinths
   
   Diskr. Mat., 4:3 (1992),  3–28
9. A new proof of the Budach – Podkolzin theorem
   
   Diskr. Mat., 3:3 (1991),  135–146
10. Traversing finite labyrinths by systems of automata
    
    Diskr. Mat., 2:2 (1990),  71–81
11. Universal labyrinth traps for finite sets of automata
    
    Diskr. Mat., 2:1 (1990),  72–79
12. Bases of a functional system
    
    Diskr. Mat., 1:4 (1989),  17–25