Znaleziono wyników: 2
Liczba wyników na stronie
Wyniki wyszukiwania
group of rules created for the chosen symmetric graph which is the same for a few groups of configurations. We analyze how they influence the behavior of cellular automata. We observed that almost all cellular automata with one symmetric graph process the input signal in similar way. Thanks to that, in the analyses of other such subclasses of cellular automata (with other symmetric graphs of connections) we can limit ourselves to the examination of the final state achieved by only one cellular automaton with representing this group rule. It lets us make the process of searching cellular automata with the complex behavior easier.
between these cellular automata is observed. They process the initial signal (picture) in qualitatively the same way. Thanks to obtained results we can expect that searching of the cellular automata space in order to extract automata with interesting behaviour can be easier. It can be reduced to testing only one cellular automaton representing such class connected with one graph of connections.
Ograniczanie wyników