( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Learning Weighted Automata over Principal Ideal Domains.

, , , и . FoSSaCS, том 12077 из Lecture Notes in Computer Science, стр. 602-621. Springer, (2020)

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.

Ruth Heerdt

Tobias Heerdt

Hermann Heerdt

Ilse Heerdt

Daniela Heerdt

 

Другие публикации лиц с тем же именем

A (co)algebraic theory of succinct automata., , , и . J. Log. Algebraic Methods Program., (2019)Learning Automata with Side-Effects., , и . CoRR, (2017)Learning Weighted Automata over Principal Ideal Domains., , , и . FoSSaCS, том 12077 из Lecture Notes in Computer Science, стр. 602-621. Springer, (2020)A Categorical Framework for Learning Generalised Tree Automata., , , , и . CMCS, том 13225 из Lecture Notes in Computer Science, стр. 67-87. Springer, (2022)A Categorical Framework for Learning Generalised Tree Automata., , , , и . CoRR, (2020)Learning Weighted Automata over Principal Ideal Domains., , , и . CoRR, (2019)Learning Pomset Automata., , , и . FoSSaCS, том 12650 из Lecture Notes in Computer Science, стр. 510-530. Springer, (2021)Tree-Based Adaptive Model Learning., , и . A Journey from Process Algebra via Timed Automata to Model Learning, том 13560 из Lecture Notes in Computer Science, стр. 164-179. Springer, (2022)Learning to Coordinate., , , и . It's All About Coordination, том 10865 из Lecture Notes in Computer Science, стр. 139-159. Springer, (2018)Tree Automata as Algebras: Minimisation and Determinisation., , , , и . CALCO, том 139 из LIPIcs, стр. 6:1-6:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)