Finite State Automata and Connectionist Machines: A survey Export

@incollection{citeulike:5300535, abstract = {Work in the literature related to Finite State Automata (FSAs) and Neural Networks (NNs) is review. These studies have dealt with Grammatical Inference tasks as well as how to represent FSAs through a neural model. The inference of Regular Grammars through NNs has been focused either on the acceptance or rejection of strings generated by the grammar or on the prediction of the possible successor(s) for each character in the string. Different neural architectures using first and second order connections were adopted. In order to extract the FSA inferred by a trained net, several techniques have been described in the literature, which are also reported here. Finally, theoretical work about the relationship between NNs and FSAs is outlined and discussed.}, author = {Casta\~{n}o, M. and Vidal, E. and Casacuberta, F.}, citeulike-article-id = {5300535}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/3-540-59497-3_206}, citeulike-linkout-1 = {http://www.springerlink.com/content/7v0u4t156h416115}, doi = {10.1007/3-540-59497-3_206}, journal = {From Natural to Artificial Neural Computation}, keywords = {fsm}, pages = {433--440}, posted-at = {2009-07-30 00:26:09}, priority = {2}, title = {Finite State Automata and Connectionist Machines: A survey}, url = {http://dx.doi.org/10.1007/3-540-59497-3_206}, year = {1995} }

TY - CHAP ID - citeulike:5300535 L3 - citeulike-article-id:5300535 N2 - Work in the literature related to Finite State Automata (FSAs) and Neural Networks (NNs) is review. These studies have dealt with Grammatical Inference tasks as well as how to represent FSAs through a neural model. The inference of Regular Grammars through NNs has been focused either on the acceptance or rejection of strings generated by the grammar or on the prediction of the possible successor(s) for each character in the string. Different neural architectures using first and second order connections were adopted. In order to extract the FSA inferred by a trained net, several techniques have been described in the literature, which are also reported here. Finally, theoretical work about the relationship between NNs and FSAs is outlined and discussed. JF - From Natural to Artificial Neural Computation EP - 440 TI - Finite State Automata and Connectionist Machines: A survey SP - 433 KW - fsm AU - Castaño, M AU - Vidal, E AU - Casacuberta, F PY - 1995/// UR - http://dx.doi.org/10.1007/3-540-59497-3_206 ER -