论文信息 - An evolution strategy for the induction of fuzzy finite-state automata

An evolution strategy for the induction of fuzzy finite-state automata

This paper presents an evolution strategy to induce fuzzy finite-state automata from examples of fuzzy languages .The coding, fitness function of a generated automaton and corresponding mutation operators are given respectively. The application example given at last shows the effectiveness of the proposed evolution strategy for automata induction.

Lan Shu | Min Wan | Zhiwen Mo

[1] Taylor L. Booth,et al. Grammatical Inference: Introduction and Survey-Part I , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2] Armando Blanco,et al. Fuzzy automaton induction using neural network , 2001, Int. J. Approx. Reason..

[3] Karvel K. Thornber,et al. Fuzzy finite-state automata can be deterministically encoded into recurrent neural networks , 1998, IEEE Trans. Fuzzy Syst..

[4] J. Elman. Distributed Representations, Simple Recurrent Networks, And Grammatical Structure , 1991 .

[5] Christian Lebiere,et al. The Cascade-Correlation Learning Architecture , 1989, NIPS.

[6] Teuvo Kohonen,et al. The self-organizing map , 1990 .

[7] Raymond L. Watrous,et al. Induction of Finite-State Languages Using Second-Order Recurrent Networks , 1992, Neural Computation.