Frasconi, Paolo; Gori, Marco; Maggini, Marco; Soda, Giovanni Representation of finite state automata in recurrent radial basis function networks. (English) Zbl 0849.68082 Mach. Learn. 23, No. 1, 5-32 (1996). Summary: We propose some techniques for injecting finite state automata into Recurrent Radial Basis Function networks (R\(^2\)BF). When providing proper hints and constraining the weight space properly, we show that these networks behave as automata. A technique is suggested for forcing the learning process to develop automata representations that is based on adding a proper penalty function to the ordinary cost. Successful experimental results are shown for inductive inference of regular grammars. Cited in 3 Documents MSC: 68Q45 Formal languages and automata 68T05 Learning and adaptive systems in artificial intelligence Keywords:recurrent radial basis function networks; finite state automata PDFBibTeX XMLCite \textit{P. Frasconi} et al., Mach. Learn. 23, No. 1, 5--32 (1996; Zbl 0849.68082)