Систолическая реализация конечных автоматов

Abstract

The use of the Boolean algebra of cubic functions as a theoretical fundamenials for design of a programmed finite automaton with parallel data processing is considered The parallel realization of two types o f finite automaton at the microlevel is shown. The universal programmed systolic structure with the identical local information connections is offered