An evolving algebra approach to formal description of a class of automata networks

The Automata Networks considered here and called Hyperbolic Cellular Automata are based on Iterated Function Systems and can be considered as a generalization of Cellular Automata. The Evolving Algebras have been proposed by Yuri Gurevich to be the models for arbitrary computational processes. They provide a formal method for executable specifications. In the paper, an evolving algebra approach to formal description of Hyperbolic Cellular Automata is presented.