A directed graph allowing for the exploration of the set of number-conserving non-uniform one-dimensional binary cellular automata with radius one and half
Gespeichert in:
| Titel: | A directed graph allowing for the exploration of the set of number-conserving non-uniform one-dimensional binary cellular automata with radius one and half |
|---|---|
| Autoren: | Wolnik, Barbara, Dziemiańczuk, Maciej, Makuracki, Bartosz, De Baets, Bernard |
| Quelle: | NATURAL COMPUTING |
| Verlagsinformationen: | Springer Science and Business Media LLC, 2025. |
| Publikationsjahr: | 2025 |
| Schlagwörter: | Mathematics and Statistics, COMPLEXITY, finite grids, non-uniform cellular automata, Finite grids, number conservation, Non-uniform cellular automata, Number conservation |
| Beschreibung: | The main obstacle in the quest for non-uniform cellular automata that meet the often desired property of number conservation is the vast size of the search space, going far beyond the capabilities of today’s computers. In this paper, we expound the construction of a directed graph $$\Pi $$ Π related to the set of all number-conserving non-uniform one-dimensional binary cellular automata with radius one and half (i.e., the neighborhood of a cell consists of four cells). We show that there is a one-to-one correspondence between the set of all such cellular automata on a finite grid with n cells and the set of all length-n closed directed walks in $$\Pi $$ Π . This provides us with a powerful tool to investigate non-uniform cellular automata of this type. |
| Publikationsart: | Article |
| Dateibeschreibung: | application/pdf |
| Sprache: | English |
| ISSN: | 1572-9796 1567-7818 |
| DOI: | 10.1007/s11047-025-10015-y |
| Zugangs-URL: | https://biblio.ugent.be/publication/01K58WD4RYXDS7VTTTZJX1T3E6 http://hdl.handle.net/1854/LU-01K58WD4RYXDS7VTTTZJX1T3E6 http://doi.org/10.1007/s11047-025-10015-y https://biblio.ugent.be/publication/01K58WD4RYXDS7VTTTZJX1T3E6/file/01K591SEYGH3G01AAQA5XPMR92 |
| Rights: | CC BY |
| Dokumentencode: | edsair.doi.dedup.....ca1fb12e596805644ad02a0b73c73c00 |
| Datenbank: | OpenAIRE |
Full Text Finder 
Nájsť tento článok vo Web of Science | Abstract: | The main obstacle in the quest for non-uniform cellular automata that meet the often desired property of number conservation is the vast size of the search space, going far beyond the capabilities of today’s computers. In this paper, we expound the construction of a directed graph $$\Pi $$ Π related to the set of all number-conserving non-uniform one-dimensional binary cellular automata with radius one and half (i.e., the neighborhood of a cell consists of four cells). We show that there is a one-to-one correspondence between the set of all such cellular automata on a finite grid with n cells and the set of all length-n closed directed walks in $$\Pi $$ Π . This provides us with a powerful tool to investigate non-uniform cellular automata of this type. |
|---|---|
| ISSN: | 15729796 15677818 |
| DOI: | 10.1007/s11047-025-10015-y |