Memory Contraction for an Automaton Stable to Injuries and Competitions in Its Internal Elements

The states of an asynchronous finite automaton are coded in accordance with each input signal (Liu's method), thereby eliminating critical competitions. An exhaustive method is developed for allocating the places in the individual codes, thereby minimizing (for the given coding method) the number of elements in the automaton storage. The symbols of the resulting code words are regarded as informational symbols, and the automaton is stabilized to injuries as well as competitions among its memory elements by means of a conventional linear coding.