Extended Cellular Automata
Pouya Mehdipour, Mostafa Salarinoghabi, Paula Gibrim
TL;DR
This paper extends one-dimensional Cellular Automata to include two symbol sets and rules, proving a new theorem that aids in analyzing complex systems with dual phenomena.
Contribution
It introduces an extended version of Cellular Automata with two symbol sets and rules, along with the proof of the Extended Curtis-Hedlund-Lyndon Theorem.
Findings
Proved the Extended Curtis-Hedlund-Lyndon Theorem.
Demonstrated the utility of the extended automata in studying complex dual-phenomena systems.
Provided a framework for co-studying related complex systems.
Abstract
In this work, the one-dimensional Cellular Automaton is extended to one that involves two sets of symbols and two global rules. As a main result, the Extended Curtis-Hedlund-Lyndon Theorem is demonstrated. Such constructions can be useful in studying complex systems involving two related phenomena and provide a way to their co-study.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCellular Automata and Applications