A learning method for recurrent networks based on minimization of finite automata

A novel network model and a learning algorithm based on symbol processing theory are described. The algorithm is derived from the minimization method of finite automata under the correspondence between Elman networks and finite automata. An attempt was made to learn context-free grammars by the new model network. Even though this learning method was derived under the correspondence to finite automata, the network can learn the subgrammar, which is the important feature for distinguishing context-free grammars and finite state automata.<>