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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call