( en | de | ru )

 

Disambiguation of "Bollig, Benedikt"

Author of the publication

copydeleteadd this publication to your clipboard
Extracting Context-Free Grammars from Recurrent Neural Networks using Tree-Automata Learning and A* Search.

, , , , , , , , and . ICGI, volume 153 of Proceedings of Machine Learning Research, page 113-129. PMLR, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Benedikt Bollig

Franzjosef Bollig

Beate Bollig

Heinrich Bollig

Hermann Bollig

 

Other publications of authors with the same name

Reachability in Distributed Memory Automata., , and . CSL, volume 183 of LIPIcs, page 13:1-13:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Extracting Context-Free Grammars from Recurrent Neural Networks using Tree-Automata Learning and A* Search., , , , , , , , and . ICGI, volume 153 of Proceedings of Machine Learning Research, page 113-129. PMLR, (2021)Property-Directed Verification and Robustness Certification of Recurrent Neural Networks., , , , , , , , , and . ATVA, volume 12971 of Lecture Notes in Computer Science, page 364-380. Springer, (2021)Branch-Well-Structured Transition Systems and Extensions., , and . Log. Methods Comput. Sci., (2024)Local Parallel Model Checking for the Alternation-Free µ-Calculus., , and . SPIN, volume 2318 of Lecture Notes in Computer Science, page 128-147. Springer, (2002)Round- and context-bounded control of dynamic pushdown systems., , and . Formal Methods Syst. Des., 62 (1): 41-78 (June 2024)Parallel Model Checking for the Alternation Free µ-Calculus., , and . TACAS, volume 2031 of Lecture Notes in Computer Science, page 543-558. Springer, (2001)Realizability of Concurrent Recursive Programs., , and . FoSSaCS, volume 5504 of Lecture Notes in Computer Science, page 410-424. Springer, (2009)Non-Sequential Theory of Distributed Systems., and . CoRR, (2019)Bounded Reachability Problems Are Decidable in FIFO Machines., , and . CONCUR, volume 171 of LIPIcs, page 49:1-49:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)