Additive Cellular Automata

Additive Cellular Automata

Additive Cellular Automata

This book presents an extensive survey and report of related research on important developments in cellular automata (CA) theory. The authors introduce you to this theory in a comprehensive manner that will help you understand the basics of CA and be prepared for further research. They illustrate the matrix algebraic tools that characterize group CA and help develop its applications in the field of VLSI testing. The text examines schemes based on easily testable FSM, bit-error correcting code, byte error correcting code, and characterization of 2D cellular automata. In addition, it looks into CA-based universal pattern generation, data encryption, and synthesis of easily testable combinational logic. The book covers new characterizations of group CA behavior, CA-based tools for fault diagnosis, and a wide variety of applications to solve real-life problems.

Additive Cellular Automata and Algebraic Series

Abstract: "A cellular automaton is an array of regularly interconnected identical cells. We study here the special case of automata where each cell depends in additive manner on its neighbours. The successives [sic] states of a given cell form a sequence whose generating series is proved to be always an algebraic series. We also examplify [sic] the realization of a given algebraic series by means of an automaton. As a byproduct we obtain a relation between additive cellular automata and certain 'automatic sequences' like the paper folding sequence."