First we consider the question of identifying linear transformations that transform any additive CA rule into an additive CA rule with an isomorphic STD. A ...

Index Permutations and Classes of Additive Cellular Automata Rules with Isomorphic STD Valeriy Bulitko and Burton Voorhees Abstract · Full Text (IP). p. 29-49

We study sources of isomorphisms of additive cellular automata on finite groups (called index-group). It is shown that many isomorphisms (called regular) of ...

Apr 25, 2024 · Index Permutations and Classes of Additive Cellular Automata Rules with Isomorphic STD. J. Cell. Autom. 5(1-2): 1-28 (2010). [j20]. view.

Rules having isomorphic STDs are at the same level in the baker diagram (but rules at the same level but not on cycles do not necessarily have isomorphic STDs).

Additive cellular automata are the simplest class of cellular automata. They have been extensively studied from both theoretical and practical perspectives.

An additive cellular automaton is a cellular automaton whose update rule satisfies the condition that its action on the sum of two states is equal to the sum ...

Index Permutations and Classes of Additive Cellular Automata Rules with Isomorphic STD. Journal of Cellular Automata, 2010. Index Permutations and Classes of ...

Bulitko, Burton Voorhees: Index Permutations and Classes of Additive Cellular Automata Rules with Isomorphic STD. 1-28. view. electronic edition ...

Missing: Permutations STD.