1. The one-dimensional Cellular Automaton below is a variation on Elementary Cellular Automaton Rule 30 at Wolfram MathW

[answerhappygod]

1 The One Dimensional Cellular Automaton Below Is A Variation On Elementary Cellular Automaton Rule 30 At Wolfram Mathw 1 (110.11 KiB) Viewed 59 times

1. The one-dimensional Cellular Automaton below is a variation on Elementary Cellular Automaton Rule 30 at Wolfram MathWorld. The Cellular Automaton has alphabet {0,1} and rules So, if t is a positive multiple of 3, i.e., t = 3,6,9,... c(0)= 1, otherwise C(20)=0 1, if c,(x-1)+c(x)+c,(x+1)=1 or ((x - 1) = 0 and c(x) + c(x+1)=2) 1<x< 19 C++1(x) = 0, otherwise In this question, you will implement this Cellular Automaton with m= 21 cells and initial conditions 1, if x = 0 Co(x)= 0, otherwise You should review Exercises 1 and 4 from the spreadsheet tutorial for the Cellular Automaton module before attempting this question. (a) Set up column labels from c(0) to c(20) and a column of time t labels from 0 to 20 as in Exercise 1 of the spreadsheet tutorial. (b) Use the method of Exercise 1 from the spreadsheet tutorial to calculate the states of the above Cellular Automaton for 20 iterations. (c) Use conditional formatting to set the cells containing land 0 to contrasting colours. If your spread- sheet program doesn't support different background colours, use some kind of conditional formatting that makes it easy to see which cells contain zeros and which contain ones.