View in EDS

Evolutionary Trajectories by Recursive Analysis of 1D Cellular Automata.

Saved in:
Bibliographic Details
Title: Evolutionary Trajectories by Recursive Analysis of 1D Cellular Automata.
Authors: Ghosh, Arijit1,2 (AUTHOR) arijit.maths@gmail.com, Sahoo, Sudhakar1 (AUTHOR) sudhakar.sahoo@gmail.com
Source: International Journal of Bifurcation & Chaos in Applied Sciences & Engineering. Sep2026, Vol. 36 Issue 11, p1-24. 24p.
Subjects: Cellular automata, Boolean expressions, Mathematical logic, Mathematical analysis
Abstract: In this paper, extensive analysis has been done using the recursive evaluation technique on One-Dimensional Cellular Automata (1D CA). This approach focuses on tracking the formation of cell values and identifying the contributing cells from the initial configuration at a given generation. Coining the new naming convention of fundamental rules in 1D CA, along with their groups and different Boolean operators, the closed-form formula has been derived for certain CA. Cell values at the nth generation without even explicitly computing the intermediate iteration steps have been attempted. These are derived through nested symbolic expressions that trace back to the initial state, enabling both symbolic and visual analysis of rule evolution. Our approach accommodates both uniform rules, characterized by a common update function applied to all cells and nonuniform rule sets, in which individual cells evolve under distinct logical functions. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of Bifurcation & Chaos in Applied Sciences & Engineering is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:In this paper, extensive analysis has been done using the recursive evaluation technique on One-Dimensional Cellular Automata (1D CA). This approach focuses on tracking the formation of cell values and identifying the contributing cells from the initial configuration at a given generation. Coining the new naming convention of fundamental rules in 1D CA, along with their groups and different Boolean operators, the closed-form formula has been derived for certain CA. Cell values at the nth generation without even explicitly computing the intermediate iteration steps have been attempted. These are derived through nested symbolic expressions that trace back to the initial state, enabling both symbolic and visual analysis of rule evolution. Our approach accommodates both uniform rules, characterized by a common update function applied to all cells and nonuniform rule sets, in which individual cells evolve under distinct logical functions. [ABSTRACT FROM AUTHOR]
ISSN:02181274
DOI:10.1142/S0218127426501488