Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2501.02622 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910773603729408 |
|---|---|
| author | Dridi, Sara |
| author_facet | Dridi, Sara |
| contents | This article presents a new characterization of controllability and regional controllability of Deterministic Cellular Automata (CA for short). It focuses on analyzing these problems within the framework of control theory, which have been extensively studied for continuous systems modeled by partial differential equations (PDEs). In the analysis of linear systems, the Kalman rank condition is ubiquitous and has been used to obtain the main results characterizing controllability. The aim of this paper is to highlight new ways to prove the regional controllability and controllability of CA using concepts from symbolic dynamics instead of using the Kalman condition. Necessary and sufficient conditions are given using the notions of chain transitive, chain mixing, trace approximation, transitive SFT and mixing SFT. Finally, we demonstrate that the presence of visibly blocking words implies that the cellular automaton is not controllable. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_02622 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | New Characterization of regional controllability and controllability of deterministic cellular automata via topological and symbolic dynamics notions Dridi, Sara Dynamical Systems This article presents a new characterization of controllability and regional controllability of Deterministic Cellular Automata (CA for short). It focuses on analyzing these problems within the framework of control theory, which have been extensively studied for continuous systems modeled by partial differential equations (PDEs). In the analysis of linear systems, the Kalman rank condition is ubiquitous and has been used to obtain the main results characterizing controllability. The aim of this paper is to highlight new ways to prove the regional controllability and controllability of CA using concepts from symbolic dynamics instead of using the Kalman condition. Necessary and sufficient conditions are given using the notions of chain transitive, chain mixing, trace approximation, transitive SFT and mixing SFT. Finally, we demonstrate that the presence of visibly blocking words implies that the cellular automaton is not controllable. |
| title | New Characterization of regional controllability and controllability of deterministic cellular automata via topological and symbolic dynamics notions |
| topic | Dynamical Systems |
| url | https://arxiv.org/abs/2501.02622 |