Abstract:
A computer algorithm is discussed for global redundancy of finite automata in uniform computing arrays (UGA) some cells of which are faulty. The method yields an acceptable solution with the aid of a practicable selection. The desired solution is obtained with the number of stand by UGA cells almost halved in comparison with conventional methods.