טוען...
On Simulation in Automata Networks
An automata network is a finite graph where each node holds a state from some finite alphabet and is equipped with an update function that changes its state according to the configuration of neighboring states. More concisely, it is given by a finite map [Formula: see text]. In this paper we study h...
שמור ב:
| הוצא לאור ב: | Beyond the Horizon of Computability |
|---|---|
| Main Authors: | , , |
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
2020
|
| נושאים: | |
| גישה מקוונת: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7309508/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-51466-2_24 |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|