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 states of a given cell form a sequence whose generating series proved to be always an algebric series. We also examplify the realization of a given algebraic series by means of an automaton. As a by product we obtain a relation between additive cellular automata and certain "automatic sequences" like the paper folding sequence.