Sequentialization and procedural complexity in automata networks (Q2055976)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7437227
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sequentialization and procedural complexity in automata networks |
scientific article; zbMATH DE number 7437227 |
Statements
Sequentialization and procedural complexity in automata networks (English)
0 references
1 December 2021
0 references
automata networks
0 references
intrinsic simulation
0 references
parallel update schedule
0 references
sequential
0 references
update schedules
0 references
procedural complexity
0 references
interaction graph
0 references
0 references
0 references
0 references
0 references
0.7750626802444458
0 references
0.7632656097412109
0 references
0.7120835185050964
0 references
0.7108703255653381
0 references
