A survey of model learning techniques for recurrent neural networks

DOI10.1007/978-3-031-15629-8_5zbMath1524.68309OpenAlexW4296970018MaRDI QIDQ6163882

Martin Leucker, Daniel Neider, Benedikt Bollig

Publication date: 26 July 2023

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

Full work available at URL: https://doi.org/10.1007/978-3-031-15629-8_5

zbMATH Keywords

recurrent neural networksmodel learningautomata learning

Mathematics Subject Classification ID

Artificial neural networks and deep learning (68T07) Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Query learning of regular tree languages: How to avoid dead states
• Learning regular sets from queries and counterexamples
• Synthesizing context-free grammars from recurrent neural networks
• Statistical model checking
• Property-directed verification and robustness certification of recurrent neural networks
• Inference of finite automata using homing sequences
• Adding nesting structure to words
• A theory of the learnable
• Rule Extraction from Recurrent Neural Networks: ATaxonomy and Review
• Probability Inequalities for Sums of Bounded Random Variables
• Automata, Languages and Programming
• Formal specification for deep neural networks