Implementation of totalistic cellular automata
Monica Dascălu, Eduard Franți · 2002
In this paper we present a low complexity cellular automata that can be easily realised in hardware version. This version of cellular automata implements the subset of totalistic local rules. The paper describes the structure of a typical cell running totalistic functions and its behaviour, and also the design of the global cellular automata.