Asynchronism in Cellular Automata
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929659994701824 |
|---|---|
| author | Gautam, Virendra Kumar |
| author_facet | Gautam, Virendra Kumar |
| contents | This study introduces Skewed Fully Asynchronous Cellular Automata (SACA), a novel update scheme in cellular automata that updates the states of only two consecutive and adjacent cells, such as ci and ci+1, simultaneously at each time step. The behavior and dynamics of elementary cellular automata (ECA) under this scheme are analyzed and compared with those of synchronous and fully asynchronous update methods. The comparative analysis highlights a range of phenomena, including transitions in ECAs from convergent or non-reversible dynamics to reversible, divergent behavior. The divisibility of lattice size by 2 or 4 is shown to have significant effects on the system dynamics, linked to the presence or absence of atomicity. The study also explores the convergence of ECAs to all-zero or all-one point attractors under SACA, providing theoretical insights that align with experimental findings.
Additionally, the research investigates the application of fully asynchronous cellular automata in solving clustering problems. Clustering is defined as grouping objects with similar properties. The proposed method employs reversible asynchronous cellular automata to merge clusters iteratively based on their closeness, continuing until the desired number of clusters is achieved. This approach leverages a small set of rules, leading to faster convergence and efficiency in clustering tasks. The findings underscore the potential of asynchronous cellular automata as a versatile and effective framework for studying complex system dynamics and solving practical problems such as clustering. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_02578 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Asynchronism in Cellular Automata Gautam, Virendra Kumar Formal Languages and Automata Theory This study introduces Skewed Fully Asynchronous Cellular Automata (SACA), a novel update scheme in cellular automata that updates the states of only two consecutive and adjacent cells, such as ci and ci+1, simultaneously at each time step. The behavior and dynamics of elementary cellular automata (ECA) under this scheme are analyzed and compared with those of synchronous and fully asynchronous update methods. The comparative analysis highlights a range of phenomena, including transitions in ECAs from convergent or non-reversible dynamics to reversible, divergent behavior. The divisibility of lattice size by 2 or 4 is shown to have significant effects on the system dynamics, linked to the presence or absence of atomicity. The study also explores the convergence of ECAs to all-zero or all-one point attractors under SACA, providing theoretical insights that align with experimental findings. Additionally, the research investigates the application of fully asynchronous cellular automata in solving clustering problems. Clustering is defined as grouping objects with similar properties. The proposed method employs reversible asynchronous cellular automata to merge clusters iteratively based on their closeness, continuing until the desired number of clusters is achieved. This approach leverages a small set of rules, leading to faster convergence and efficiency in clustering tasks. The findings underscore the potential of asynchronous cellular automata as a versatile and effective framework for studying complex system dynamics and solving practical problems such as clustering. |
| title | Asynchronism in Cellular Automata |
| topic | Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2501.02578 |