Old Web
English
Sign In
Acemap
>
Paper
>
Extracting Context-Free Grammars from Recurrent Neural Networks using Tree-Automata Learning and A* Search
Extracting Context-Free Grammars from Recurrent Neural Networks using Tree-Automata Learning and A* Search
2021
Benoît Barbot
Benedikt Bollig
Alain Finkel
Serge Haddad
Igor Khmelnitsky
Martin Leucker
Daniel Neider
Rajarshi Roy
Lina Ye
Keywords:
Context-free grammar
Theoretical computer science
automata learning
Tree (data structure)
Computer science
Recurrent neural network
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]