Identification of Nonstationary Cellular Automata

The principal feature of nonstationary cellular automata (NCA) is that a local transition rule of each cell is changed at each time step depending on neighborhood configuration at previous time- step The identification problem for NCA is extraction of local transition rules and the establishment of mecha- nism for changing these rules using sequence of NCA configurations. We present serial and parallel algorithms for identification of NCA.