Encoding nondeterministic finite-state tree automata in sigmoid recursive neural networks

DOI10.1007/3-540-44522-6_21MaRDI QIDQ4536490zbMATH OpenFDO

Authors Mikel L. Forcada, Rafael C. Carrasco

Publication date 5 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44522-6_21

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Representation of finite state automata in recurrent radial basis function networks
• Constructing deterministic finite-state automata in recurrent neural networks
• Neural networks for adaptive processing of structured data
• Learning with recurrent neural networks
• scientific article; zbMATH DE number 2079880

Cited in

(5)

• Deep reservoir neural networks for trees
• Recursive tree grammar autoencoders
• Constructing deterministic finite-state automata in recurrent neural networks
• Neural networks for adaptive processing of structured data
• 10.1162/153244304773936117

This page was built for publication: Encoding nondeterministic finite-state tree automata in sigmoid recursive neural networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536490)