scientific article; zbMATH DE number 53316

zbMATH Open0755.68016MaRDI QIDQ4003541FDOQ4003541

Authors:

Publication date: 23 January 1993

Title of this publication is not available (Why is that?)

Recommendations

• Learning automata from ordered examples
• Connectionist learning of regular graph grammars
• Simple recurrent networks learn context-free and context-sensitive languages by counting.
• scientific article; zbMATH DE number 108115
• Learning with recurrent neural networks

zbMATH Keywords

machine learninglanguage learningfinite state automatonautomata inductionMachine learninglearning from examplesconnectionismLanguage learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Symbolic computation and algebraic computation (68W30) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited In (11)

• Linear recursive distributed representations
• Simple recurrent networks learn context-free and context-sensitive languages by counting.
• Comparing simple recurrent networks and \(n\)-grams in a large corpus
• Learning the dynamics of embedded clauses
• Connectionist learning of regular graph grammars
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Pre-wiring and pre-training: what does a neural network need to learn truly general identity rules?
• Title not available (Why is that?)
• On the Emergence of Rules in Neural Networks

This page was built for publication:

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