Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    ISSN: 1573-773X
    Keywords: recurrent neural network ; grammatical inference ; finite-state automata ; regular grammar ; tomita grammars
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In this study, we proposed an adaptive recurrent neural network that is capable of inferring a regular grammar, and at the same time of extracting the underlying grammatical rules emulated by a finite-state automata. Our proposed network adapts from an initial analog phase, which has good training behavior, to a discrete phase for automatic rule extraction. A modified objective function is proposed to accomplish the discretisation process as well as logic learning. Comparison on learning Tomita grammars shows that our network has a significant advantage over other approaches.
    Type of Medium: Electronic Resource
    Signatur Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...