Isomorphisms of Additive Cellular Automata on Finite Groups

Details Isomorphisms of Additive Cellular Automata on Finite Groups Isomorphisms of Additive Cellular Automata on Finite Groups

2008-11-29

arxiv.org/abs/0812.0111v1

Nonlinear Sciences

Cellular Automata and Lattice Gases

24 pages

Scientific paper

We study sources of isomorphisms of additive cellular automata on finite groups (called index-group). It is shown that many isomorphisms (called regular) of automata are reducible to the isomorphisms of underlying algebraic structures (such as the index-group, monoid of automata rules, and its subgroup of reversible elements). However for some groups there exist not regular automata isomorphisms. A complete description of linear automorphisms of the monoid is obtained. These automorphisms cover the most part of all automata isomorphisms for small groups and are represented by reversible matrices M such that for any index-group circulant C the matrix M^{-1}CM is an index-group circulant.

Affiliated with

Also associated with

No associations

Rating

Isomorphisms of Additive Cellular Automata on Finite Groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Isomorphisms of Additive Cellular Automata on Finite Groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Isomorphisms of Additive Cellular Automata on Finite Groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-54667