|
Problemy Peredachi Informatsii, 1988, Volume 24, Issue 2, Pages 86–93
(Mi ppi700)
|
|
|
|
Automata Theory and Communication-Network Theory
Cycles in Collectives of Threshold Automata
I. N. Karbovskii
Abstract:
We prove that cycles of length $m\ge 3$ are impossible for symmetrical connection matrices in the class of regular collectives of threshold automata, which includes finite collectives and homogeneous networks as subclasses.
Received: 17.12.1985
Citation:
I. N. Karbovskii, “Cycles in Collectives of Threshold Automata”, Probl. Peredachi Inf., 24:2 (1988), 86–93; Problems Inform. Transmission, 24:2 (1988), 152–158
Linking options:
https://www.mathnet.ru/eng/ppi700 https://www.mathnet.ru/eng/ppi/v24/i2/p86
|
Statistics & downloads: |
Abstract page: | 167 | Full-text PDF : | 75 |
|