Abstract
Second-order recurrent networks that recognize simple finite state languages over {0,1}* are induced from positive and negative examples. Using the complete gradient of the recurrent network and sufficient training examples to constrain the definition of the language to be induced, solutions are obtained that correctly recognize strings of arbitrary length.
This content is only available as a PDF.
© 1992 Massachusetts Institute of Technology
1992
You do not currently have access to this content.