On algorithms for design of finite automata in uniform computing arrays with faulty cells

The paper is concerned with an algorithm for implementing (global reserving) of finite automata in uniform computing arrays (UCA) with some cells faulty. The structural graph of the finite automaton is rearranged with an allowance for the position of faulty cells and an admissible multiplicity of the reserve is obtained without search. An approach, diametrically different from the conventional ones, to implementation (reserving) of finite automata in UCA's also requires rearrangement of the structural UCA graph. With some additional hardware, the algorithm saves time in reserving.