Abstract
2‐dimensional finite cellular automata defined by local rule based on hexagonal cell structure are studied. Rule matrix of the hexagonal finite cellular automaton is obtained. The rank of rule matrices related to hexagonal finite cellular automata via an algorithm is computed. By using the matrix algebra it is shown that the hexagonal finite cellular automata are reversible, if the number of columns is even and the hexagonal finite cellular automata are not reversible, if the number of the columns is odd.
Keywords
Cellular automaton
Hexagonal crystal system
Continuous spatial automaton
Stochastic cellular automaton
Hexagonal tiling
Block cellular automaton
Quantum finite automata
Deterministic finite automaton
Matrix (chemical analysis)
Rank (graph theory)
Mobile automaton
Quantum cellular automaton
Mathematics
Finite-state machine
Combinatorics
Discrete mathematics
Pure mathematics
Algorithm
Automaton
Computer science
Theoretical computer science
Automata theory
Crystallography
Materials science
Chemistry
Subject Areas
Cellular Automata and Applications
·Computational Theory and Mathematics ·Physical Sciences
Advanced Data Storage Technologies
·Computer Networks and Communications ·Physical Sciences
DNA and Biological Computing
·Molecular Biology ·Life Sciences
Citations by Year
2013: 2
2014: 2
2015: 1
2016: 2
2017: 1
2018: 1
2020: 1
2021: 2
2025: 1
Loading…
Loading…