( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Categorical Framework for Learning Generalised Tree Automata.

, , , , и . CMCS, том 13225 из Lecture Notes in Computer Science, стр. 67-87. Springer, (2022)

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.

Matteo Garavoglia

Matteo Rini

Marco Matteo

Matteo Bertini

Matteo Gabba

 

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

Algebras for Tree Decomposable Graphs., , и . ICGT, том 12150 из Lecture Notes in Computer Science, стр. 203-220. Springer, (2020)A coalgebraic semantics for causality in Petri nets., , и . J. Log. Algebraic Methods Program., 84 (6): 853-883 (2015)Learning nominal automata., , , , и . POPL, стр. 613-625. ACM, (2017)Symbolic Register Automata., , , и . CAV (1), том 11561 из Lecture Notes in Computer Science, стр. 3-21. Springer, (2019)A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours., и . TGC, том 8902 из Lecture Notes in Computer Science, стр. 97-111. Springer, (2014)Causal Trees, Finally., , и . Programming Languages with Applications to Biology and Security, том 9465 из Lecture Notes in Computer Science, стр. 27-43. Springer, (2015)A (co)algebraic theory of succinct automata., , , и . CoRR, (2019)Residual Nominal Automata., и . CONCUR, том 171 из LIPIcs, стр. 44:1-44:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)CALF: Categorical Automata Learning Framework., , и . CSL, том 82 из LIPIcs, стр. 29:1-29:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Tree Automata as Algebras: Minimisation and Determinisation., , , , и . CALCO, том 139 из LIPIcs, стр. 6:1-6:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)