Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Goran Kilibarda"'
Autor:
Goran Kilibarda
Publikováno v:
Publications de l'Institut Math?matique (Belgrade). 109:17-34
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 labyrin
Autor:
Goran Kilibarda
Publikováno v:
Publications de l'Institut Math?matique (Belgrade). 101:47-63
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 le
Autor:
Biljana Stamatovic, Goran Kilibarda
Publikováno v:
Mathematical Problems in Engineering, Vol 2017 (2017)
We propose a finite automaton based algorithm for identification of infinite clusters in a 2D rectangular lattice with L=X×Y cells. The algorithm counts infinite clusters and finds one path per infinite cluster in a single pass of the finite automat
Autor:
Wencai Zhou, Goran Kilibarda, Ian A. Howard, Tsuneaki Sakurai, Jianxi Liu, Sabine Schlabach, Peter Lindemann, Engelbert Redel, Shu Seki, Zhengbang Wang, Yusuke Tsutsui, Christof Wöll, Jinxuan Liu, Damien E. Coupry, Matthew Addicoat, Thomas Heine, Satoru Yoneda
Publikováno v:
Angewandte Chemie. 127:7549-7553
Bei anorganischen Halbleitern fuhrt kristalline Ordnung zur Bildung einer elektronischen Bandstruktur, die deutliche Unterschiede zu ungeordnetem Material aufweist; z. B. konnen indirekte Bandlucken auftreten. Bei organischen Halbleitern werden solch
Autor:
Goran Kilibarda
Publikováno v:
Publications de l'Institut Math?matique (Belgrade). 97:69-87
An antichain is here regarded as a hypergraph that satisfies the following property: neither of every two different edges is a subset of the other one. The paper is devoted to the enumeration of antichains given on an n-set and having one or more of
Autor:
Goran Kilibarda
Publikováno v:
Graphs and Combinatorics. 23:183-199
The problem of enumeration of unlabelled mating graphs is solved by constructing a bijection between the class of unlabelled mating graphs and the class of unlabelled graphs without endpoints.
Publikováno v:
Diskretnaya Matematika. 15:3-39
Publikováno v:
Discrete Mathematics and Applications. 3:1-28
Autor:
Damien E. Coupry, Tsuneaki Sakurai, Matthew Addicoat, Engelbert Redel, Christof Wöll, Jinxuan Liu, Sabine Schlabach, Wencai Zhou, Jianxi Liu, Ian A. Howard, Goran Kilibarda, Satoru Yoneda, Peter Lindemann, Shu Seki, Yusuke Tsutsui, Thomas Heine, Zhengbang Wang
Publikováno v:
Angewandte Chemie International Edition. 54:7201-7201
Publikováno v:
Discrete Mathematics and Applications. 13