G. Cattaneo, E. Formenti, L. Margara, and G. Mauri. Transformation of the one-dimensional cellular automata rule space. Parallel Computing, 23:1593-1611, 1997. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Damage Spreading and µ-sensitivity on Cellular Automata - Martin (1999) (Correct)
....us remark that CA with di erent numbers may have the same behavior by exchanging the states 0 and 1, for instance 184 = 10111000 2 and 226 = 11100010 2 . If r is a rule number, we will denote by r the rule after exchanging the states and by r the rule which has a symmetric behavior (see [5] for more details) We will speak about the cellular automaton 120 = f0; 1g Z ; F 120 ) or equivalently of the rule 120. In the general de nition of additive CA due to Wolfram, an additive CA is a CA whose set of states is a group and that satis es the superposition principle ( x x 0 ; y ....
G. Cattaneo, E. Formenti, L. Margara, and G. Mauri. Transformation of the one-dimensional cellular automata rule space. Parallel Computing, 23:1593-1611, 1997.
A group interpretation of particles generated by one dimensional.. - Martin (1999) (Correct)
....i (1; 0; 0) a 4 i (0; 0; 1) a 1 i (1; 0; 1) a 5 i (0; 1; 0) a 2 i (1; 1; 0) a 6 i (0; 1; 1) a 3 i (1; 1; 1) a 7 2 Let us remark that CA with di erent numbers may have the same behavior by switching the states 0 and 1, for instance 184 = 10111000 2 and 226 = 11100010 2 . [3] We will speak about the cellular automata 54 = f0; 1g; 54 ) or equivalently of the rule 54. The binary writing of 54 is (54 = 00110110 2 ) so its transition function is the following: 54 (x; y; z) 8 : 1 if(x; y; z) 8 : 0; 0; 1) or (1; 0; 0) or (0; 1; 0) ....
G. Cattaneo, E. Formenti, L. Margara, and G. Mauri. Transformation of the onedimensional cellular automata rule space. Parallel Computing, 23:1593-1611, 1997.
Damage Spreading and µ-sensitivity on CA - Martin (2000) (Correct)
....a 7 Let us remark that CA with di erent numbers may have the same behavior by switching the states 0 and 1, for instance 184 = 10111000 2 and 226 = 11100010 2 . If r is a rule number, we will denote r the rule after exchanging the states and r the rule which has a symmetric behavior (see [5] for more details) We will speak about the cellular automaton 120 = f0; 1g; 120 ) or equivalently of the rule 120. In the general de nition of additive CA due to Wolfram, an additive CA is a CA that satis es the superposition principle ( x x 0 ; y y 0 ; z z 0 ) x; y; z) x 0 ....
G. Cattaneo, E. Formenti, L. Margara, and G. Mauri. Transformation of the onedimensional cellular automata rule space. Parallel Computing, 23:1593-1611, 1997.
Apparent Entropy of Cellular Automata - Martin (Correct)
....7 Let us remark that CA with di erent numbers may have the same behavior by exchanging the states 0 and 1; for instance, 184 = 10111000 2 and 226 = 11100010 2 . If r is a rule number, we will denote r the rule after exchanging the states and r the rule which has a symmetric behavior (see [4] for more details) We will discuss the CA 120 = f0; 1g; 120 ) or equivalently, of the rule 120. In the general de nition of additive CA due to Wolfram, an additive CA is a CA that satis es the superposition principle ( x x 0 ; y y 0 ; z z 0 ) x; y; z) x 0 ; y 0 ; z 0 ) ....
G. Cattaneo, E. Formenti, L. Margara, and G. Mauri, \Transformation of the One-dimensional Cellular Automata Rule Space," Parallel Computing, 23 (1997) 1593-1611.
Damage Spreading and µ-sensitivity on Cellular Automata - Martin (2000) (Correct)
....a 7 Let us remark that CAs with di erent numbers may have the same behavior by switching the states 0 and 1, for instance 184 = 10111000 2 and 226 = 11100010 2 . If r is a rule number, we will denote r the rule after exchanging the states and r the rule which has a symmetric behavior (see [5] for more details) We will speak about the cellular automaton 120 = f0; 1g; 120 ) or equivalently of the rule 120. In the general de nition of additive CAs due to Wolfram, an additive CA is a CA that satis es the superposition principle ( x x 0 ; y y 0 ; z z 0 ) x; y; z) x ....
G. Cattaneo, E. Formenti, L. Margara, and G. Mauri. Transformation of the one-dimensional cellular automata rule space. Parallel Computing, 23:1593-1611, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC