Automata

Implementation of Boolean algebra functions by programmable elements

S. A. Stepanenko

Moscow

Abstract: A method is proposed for design of a combinational programmable automaton which implements a Boolean algebra function. Formulae are obtained for estimating the time and elemental complexity of implementation. The method is shown effective in comparison with earlier methods. An automaton design algorithm is formulated.

UDC: 62-507:512.93


Received: 26.02.1980

 English version: Automation and Remote Control, 1981, 41:11, 1584–1592

Bibliographic databases:

• 
•