Algebraic characterization of Linear Finite Moore Cellular Automata on Triangular Lattice
Summary
No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.
Summarise with VIRAT Free to try with your Science Catalogs account.Abstract
Cellular automata are discrete complex phenomena of simple transition rules. This work proposes the linear finite Moore Cellular Automata on the triangular lattice with periodic boundary. Matrix algebra presents the algebraic characterization of proposed cellular automata and provides connectivity within the subsequent configurations. To delve deeper into the linear finite Moore Cellular Automata on the triangular lattice with periodic boundary, this work imparts the rule matrices which transit the configuration from one time step to the subsequent one. This work delineates the algorithm to determine the subsequent and preceding configuration of the proposed cellular automata utilizing rule matrices. Also offers the pattern evolution of the proposed cellular automata.
Fields of Study & Subjects
Cellular Automata and Applications
semigroups and automata theory
Digital Image Processing Techniques
Publication details
- Journal / source
- CRC Press eBooks
- Pages
- 211–218
- Publication date
- 26 March 2026
- Language
- EN
- Document type
- Book chapter