From 62e4fd8bd3e86bbf32e6ef64811c055958c4e1e5 Mon Sep 17 00:00:00 2001 From: "quentin@aristote.fr" Date: Sun, 16 Feb 2025 21:02:04 +0100 Subject: publications: update --- publications/publications_selected.json | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'publications/publications_selected.json') diff --git a/publications/publications_selected.json b/publications/publications_selected.json index d3fa0a4..04519c5 100644 --- a/publications/publications_selected.json +++ b/publications/publications_selected.json @@ -1,3 +1,3 @@ [ - {"id":"aristoteActiveLearningDeterministic2024","abstract":"We study monoidal transducers, transition systems arising as deterministic automata whose transitions also produce outputs in an arbitrary monoid, for instance allowing outputs to commute or to cancel out. We use the categorical framework for minimization and learning of Colcombet, Petrişan and Stabile to recover the notion of minimal transducer recognizing a language, and give necessary and sufficient conditions on the output monoid for this minimal transducer to exist and be unique (up to isomorphism). The categorical framework then provides an abstract algorithm for learning it using membership and equivalence queries, and we discuss practical aspects of this algorithm’s implementation.","accessed":{"date-parts":[["2024",2,7]]},"author":[{"family":"Aristote","given":"Quentin"}],"citation-key":"aristoteActiveLearningDeterministic2024","container-title":"DROPS-IDN/v2/document/10.4230/LIPIcs.CSL.2024.11","DOI":"10.4230/LIPIcs.CSL.2024.11","event-title":"32nd EACSL Annual Conference on Computer Science Logic (CSL 2024)","issued":{"date-parts":[["2024"]]},"language":"en","license":"https://creativecommons.org/licenses/by/4.0/legalcode","note":"Helena Rasiowa award for the Best Student Paper","publisher":"Schloss-Dagstuhl - Leibniz Zentrum für Informatik","source":"drops.dagstuhl.de","title":"Active Learning of Deterministic Transducers with Outputs in Arbitrary Monoids","type":"paper-conference","URL":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2024.11"} + {"id":"aristoteActiveLearningDeterministic2024","abstract":"We study monoidal transducers, transition systems arising as deterministic automata whose transitions also produce outputs in an arbitrary monoid, for instance allowing outputs to commute or to cancel out. We use the categorical framework for minimization and learning of Colcombet, Petrişan and Stabile to recover the notion of minimal transducer recognizing a language, and give necessary and sufficient conditions on the output monoid for this minimal transducer to exist and be unique (up to isomorphism). The categorical framework then provides an abstract algorithm for learning it using membership and equivalence queries, and we discuss practical aspects of this algorithm’s implementation.","accessed":{"date-parts":[["2024",2,7]]},"author":[{"family":"Aristote","given":"Quentin"}],"citation-key":"aristoteActiveLearningDeterministic2024","collection-title":"Leibniz International Proceedings in Informatics (LIPIcs)","container-title":"32nd EACSL Annual Conference on Computer Science Logic (CSL 2024)","DOI":"10.4230/LIPIcs.CSL.2024.11","event-place":"Dagstuhl, Germany","event-title":"Computer Science Logic (CSL)","ISBN":"978-3-95977-310-2","ISSN":"1868-8969","issued":{"date-parts":[["2024"]]},"language":"en","note":"Helena Rasiowa award for the Best Student Paper","page":"11:1-11:20","publisher":"Schloss-Dagstuhl - Leibniz Zentrum für Informatik","publisher-place":"Dagstuhl, Germany","title":"Active Learning of Deterministic Transducers with Outputs in Arbitrary Monoids","type":"paper-conference","URL":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2024.11","volume":"288"} ] -- cgit v1.2.3