Question

What is rule 90 and rule 150 to implement cellular automata?

Answer 1

Rule 90 :-
In the mathematical study of cellular automata, Rule 90 is an elementary cellular automaton based on the exclusive or function. It consists of a one-dimensional array of cells, each of which can hold either a 0 or a 1 value. In each time step all values are simultaneously replaced by the exclusive or of their two neighboring values.Martin, Odlyzko & Wolfram (1984) call it the simplest non-trivial cellular automation and it is described extensively in Stephen Wolfram's 2002 book.

Rule 150 :-
One of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983. It specifies the next color in a cell, depending on its color and its immediate neighbors. Its rule outcomes are encoded in the binary representation . This rule is illustrated above together with the evolution of a single black cell it produces after 15 steps (Wolfram 2002, p. 55).
Starting with a single black cell, successive generations are given by interpreting the numbers 1, 7, 21, 107, 273, 1911, 5189, ... (OEIS A038184) in binary, namely 1, 111, 10101, 1101011, 100010001, ... (OEIS A118110).
Rule 150 is one of the eight additive elementary cellular automata.
:-)