Key points are not available for this paper at this time.
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.
Watrous et al. (Fri,) studied this question.