PURPOSE: To make a determinative finite state automaton having resistance to fault by a recursive type neural network(RNN). CONSTITUTION: As for a network which is a secondary-weighted RNN and of a decentralization type, and has a sigmoid decision, constitution algorithm is so set as to make the concreting of DFA resistance to fault so that fault in the analog concreting of a neuron or weighting does not affect the operation of the network. For the weighting, duplication is performed (k) times for (k-1) pieces of faults. Or an independent network is duplicated (2k+1) times and made resistant to (k) pieces of faults by majority decision. Further, a network having kn neurons may be made resistant to (k) pieces of faults by 'k-out-of-n choice' encoding algorithm.
METHOD FOR ACTUALIZING TROUBLE-TOLERANT DETERMINATIVE FINITE STATE AUTOMATON IN RECURSIVE NEURAL NETWORK AND TROUBLE-TOLERANT DETERMINATIVE FINITE STATE AUTOMATON OF NETWORK