Cycles in collectives of threshold automata (Q1118409)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Cycles in collectives of threshold automata |
scientific article; zbMATH DE number 4094819
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cycles in collectives of threshold automata |
scientific article; zbMATH DE number 4094819 |
Statements
Cycles in collectives of threshold automata (English)
0 references
1988
0 references
We prove that cycles of length \(m\geq 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.
0 references
symmetrical connection matrices
0 references
regular collectives of threshold automata
0 references
homogeneous networks
0 references
0.738328754901886
0 references
0.7352370023727417
0 references
