Design of completely self-checking synchronous automata with the use of polynomial forms

The paper is concerned with design of completely self-checking synchronous automata with memory built around $D$-flip-flops. Methods are suggested for structural design of such automata with the use of polynomial forms in implementing the combinational part of the automaton.