Создание генераторов псевдослучайных последовательностей на клеточных автоматах с циклическими граничными условиями

Abstract

Cellular Automata is a discrete computing model which provides simple, flexible and efficient platform for built-in self-testing based on the neighborhoods information. The synthesis algorithm with low complexity, which solves the problem of finding a particular linear hybrid cellular automata, is described. Proposed algorithm based on heuristic brute force method on a part of cellular automata.