Affordable Access

Publisher Website

Identification of finite state automata with a class of recurrent neural networks.

Authors
Type
Published Article
Journal
IEEE transactions on neural networks / a publication of the IEEE Neural Networks Council
Publication Date
Volume
21
Issue
9
Pages
1408–1421
Identifiers
DOI: 10.1109/TNN.2010.2059040
PMID: 20709639
Source
Medline

Abstract

A class of recurrent neural networks is proposed and proven to be capable of identifying any discrete-time dynamical system. The application of the proposed network is addressed in the encoding, identification, and extraction of finite state automata (FSAs). Simulation results show that the identification of FSAs using the proposed network, trained by the hybrid greedy simulated annealing with a modified cost function in the training stage, generally exhibits better performance than the conventional identification procedures.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments