Classification of triangular and honeycomb cellular automata

Abstract Cellular automata on a two-dimensional triangular and honeycomb lattice are classified according to their fixed points and periods. The results are compared with other lattices in one of three dimensions. We also compare the totalistic rules for all mentioned lattices.