Methods for the design of stable and $d$-reliable finite automata

There are suggested two methods of coding the inner states of an asynchronous automaton, the methods securing the automaton stability to unallowable contests and failures of memory elements. The first method consists in constructing typical spacings of states; the second method takes into account the properties of the automaton transition table.