Universal cellular automaton over A hexagonal tiling with 3 states

A universal three-state three-neighbor cellular automaton will be constructed. The space selected for this cellular automaton is a hexagonal tiling where the cells are in the vertices and the neighbors are the three nearest cells. We define the local transition rule as well as the basic elements that will aid to build digital circuits and, by the way, prove the universality of this cellular automaton. The local transition rule is defined to be isotropic.