Binary Programs and Their Realization by Asynchronous Automata

We consider coding of states of asynchronous automata designed to evaluate systems of Boolean functions by means of binary programs. We show that for a fairly wide class of systems of Boolean functions race-proof state coding is irredundant.