Výsledky vyhledávání

Corecursion Up-to via Causal Transformations

Autor: Pous, D., Rot, J., Turkenburg, R., Hansen, H.H., Zanasi, F.

Publikováno v: Hansen, H.H.; Zanasi, F. (ed.), Coalgebraic Methods in Computer Science:16th IFIP WG 1.3 International Workshop, CMCS 2022, Colocated with ETAPS 2022, Munich, Germany, April 2-3, 2022, Proceedings, 133-154. Cham : Springer International Publishing
STARTPAGE=133;ENDPAGE=154;ISSN=0302-9743;TITLE=Hansen, H.H.; Zanasi, F. (ed.), Coalgebraic Methods in Computer Science:16th IFIP WG 1.3 International Workshop, CMCS 2022, Colocated with ETAPS 2022, Munich, Germany, April 2-3, 2022, Proceedings

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::d9c8abc46b64f02822ddd1146fc59749
https://hdl.handle.net/2066/282949

Zobrazit plný text záznamu

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

A Categorical Framework for Learning Generalised Tree Automata

Autor: van Heerdt, G., Kappé, T., Rot, J., Sammartino, M., Silva, A., Hansen, H.H., Zanasi, F.

Publikováno v: Coalgebraic Methods in Computer Science: 16th IFIP WG 1.3 International Workshop, CMCS 2022, colocated with ETAPS 2022, Munich, Germany, April 2-3, 2022 : proceedings, 67-87
STARTPAGE=67;ENDPAGE=87;TITLE=Coalgebraic Methods in Computer Science
Coalgebraic Methods in Computer Science ISBN: 9783031107351
Proceedings of CMCS 2022
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Coalgebraic Methods in Computer Science

Automata learning is a popular technique used to automatically construct an automaton model from queries. Much research went into devising ad hoc adaptations of algorithms for different types of automata. The CALF project seeks to unify these using c

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d813607fc9a68e75af7b061f9020ee2c
https://doi.org/10.1007/978-3-031-10736-8_4

Zobrazit plný text záznamu

From Farkas’ lemma to linear programming: An exercise in diagrammatic algebra

Autor: Bonchi F., Di Giorgio A., Zanasi F.

Farkas’ lemma is a celebrated result on the solutions of systems of linear inequalities, which finds application pervasively in mathematics and computer science. In this work we show how to formulate and prove Farkas’ lemma in diagrammatic polyhe

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::c0ce838cd5116f6440b27541aa5c8a05
http://hdl.handle.net/11568/1141043

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání