Cellular Automata perform distributed computation through the iteration of (relatively) simple logic within individual cells in an array. The following table defines the logic for a one-dimensional Cellular Automaton (CA):

Neighbourhood: 000-----001-----010-----011-----100-----101-----110-----111

.........Output bit : 0--------1---------1--------1---------0--------1--------1--------0

TASK: Show the states of each of the cells in a ten-cell, one-dimensional CA from the given start states, following the above rule for three update cycles: 0010111010

can anyone help me this problem ? plss dont spam i'll make sure a thumb down for spammer