1 research outputs found

    Translating partitioned cellular automata into classical type cellular automata

    No full text
    ISBN 978-5-94057-377-7International audiencePartitioned cellular automata are a variant of cellular automata that was defined in order to make it very simple to create complex automata having strong properties such as number conservation and reversibility (which are often difficult to obtain on cellular automata). In this article we show how a partitioned cellular automaton can be translated into a regular cellular automaton in such a way that these properties are conserved
    corecore