By Topic

Identification of a specific limitation on local-feedback recurrent networks acting as Mealy-Moore machines

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Kremer, S.C. ; Dept. of Comput. & Inf. Sci., Guelph Univ., Ont., Canada

Describes a proof which identifies limitations of local-feedback recurrent networks (LFRNs) in representing Mealy-Moore machines. Specifically, the paper identifies a class of machines that are unrepresentable in these networks. While it is known that LFRNs cannot represent all automata, this is the first paper to show a specific class of unrepresentable automata. The paper goes beyond previous work in the area by addressing realistic activation functions, arbitrary network architectures, and more general computing machines

Published in:

Neural Networks, IEEE Transactions on  (Volume:10 ,  Issue: 2 )