Automata Theory

To the Problem of Expressibility in the Algebra of Partial Boolean Functions

V. V. Tarasov

Ryazan State Radiotechnical Academy

Abstract: The paper considers the problem of expressibility of total Boolean functions by superpositions over a system of partial Boolean functions. The problem is solved in terms of precomplete Boolean classes, i.e., extensions of Post classes in the algebra of partial Boolean functions.

UDC: 621.391.1:519.713

Received: 01.10.2003
Revised: 15.06.2004

 English version: Problems of Information Transmission, 2005, 41:1, 59–64

Bibliographic databases:

• 
•