talks: csl 2024: fix link

1 files changed, 1 insertions, 1 deletions

diff --git a/research/talks.json b/research/talks.json
index 1af9c37..a126e36 100644
--- a/research/talks.json
+++ b/research/talks.json
@@ -1,5 +1,5 @@
 [
-  {"id":"aristoteActiveLearningDeterministic2024a","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.","author":[{"family":"Aristote","given":"Quentin"}],"citation-key":"aristoteActiveLearningDeterministic2024a","event-place":"Naples, Italy","event-title":"32nd EACSL Annual Conference on Computer Science Logic 2024 (CSL 2024)","genre":"conference","issued":{"date-parts":[["2024",2,22]]},"language":"en","note":"slides: https://gitlab.math.univ-paris-diderot.fr/-/project/840/uploads/441b176a634e9ed8b569d75dc18bf98a/monoidal-transducer-learning.pdf","publisher-place":"Naples, Italy","title":"Active learning of deterministic transducers with outputs in arbitrary monoids","type":"speech","URL":"https://www.irif.fr/seminaires/automates/index"},
+  {"id":"aristoteActiveLearningDeterministic2024a","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.","author":[{"family":"Aristote","given":"Quentin"}],"citation-key":"aristoteActiveLearningDeterministic2024a","event-place":"Naples, Italy","event-title":"32nd EACSL Annual Conference on Computer Science Logic 2024 (CSL 2024)","genre":"conference","issued":{"date-parts":[["2024",2,22]]},"language":"en","note":"slides: https://gitlab.math.univ-paris-diderot.fr/-/project/840/uploads/441b176a634e9ed8b569d75dc18bf98a/monoidal-transducer-learning.pdf","publisher-place":"Naples, Italy","title":"Active learning of deterministic transducers with outputs in arbitrary monoids","type":"speech","URL":"https://csl2024.github.io/Home"},
   {"id":"aristoteActiveLearningDeterministic2024b","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. In a first part I'll explain how Vilar's algorithm for the active learning à la Angluin of (normal) transducers generalize to monoidal transducers. In a second part I'll then discuss how this is an instance of the categorical framework for minimization and learning of Colcombet, Petrişan and Stabile: the active learning algorithm was obtained by instantiating monoidal transducers in this framework.","author":[{"family":"Aristote","given":"Quentin"}],"citation-key":"aristoteActiveLearningDeterministic2024b","event-place":"Paris, France","event-title":"Séminaire Automates (IRIF)","genre":"seminar","issued":{"date-parts":[["2024",3,22]]},"language":"en","note":"slides: https://gitlab.math.univ-paris-diderot.fr/-/project/840/uploads/46406ee1029eeaa311f952e661cc742c/monoidal-transducer-learning.pdf","publisher-place":"Paris, France","title":"Active learning of deterministic transducers with outputs in arbitrary monoids","type":"speech","URL":"https://www.irif.fr/seminaires/automates/index"},
   {"id":"aristoteActiveLearningDeterministic2024c","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. In a first part I'll explain how Vilar's algorithm for the active learning à la Angluin of (normal) transducers generalize to monoidal transducers. In a second part I'll then discuss how this is an instance of the categorical framework for minimization and learning of Colcombet, Petrişan and Stabile: the active learning algorithm was obtained by instantiating monoidal transducers in this framework.","author":[{"family":"Aristote","given":"Quentin"}],"citation-key":"aristoteActiveLearningDeterministic2024c","event-place":"Oxford, United Kingdom","event-title":"Verification seminar","genre":"seminar","issued":{"date-parts":[["2024",6,17]]},"language":"en","note":"slides: https://gitlab.math.univ-paris-diderot.fr/-/project/840/uploads/46406ee1029eeaa311f952e661cc742c/monoidal-transducer-learning.pdf","publisher-place":"Oxford, United Kingdom","title":"Active learning of deterministic transducers with outputs in arbitrary monoids","type":"speech","URL":"https://www.cs.ox.ac.uk/research/verification/"},
   {"id":"aristoteActiveLearningUpwardclosed2025a","abstract":"We give a new proof of a result from well quasi-order theory on the computability of bases for upwards-closed sets of words. This new proof is based on Angluin's L* algorithm, that learns an automaton from a minimally adequate teacher. This relates in particular two results from the 1980s: Angluin's L* algorithm, and a result from Valk and Jantzen on the computability of bases for upwards-closed sets of tuples of integers.\n\nAlong the way, we describe an algorithm for learning quasi-ordered automata from a minimally adequate teacher, and extend a generalization of Valk and Jantzen's result, encompassing both words and integers, to finitely generated monoids.","author":[{"family":"Aristote","given":"Quentin"}],"citation-key":"aristoteActiveLearningUpwardclosed2025a","event-place":"Glasgow, Scotland","event-title":"11th Conference on Algebra and Coalgebra in Computer Science (CALCO 2025)","genre":"conference","issued":{"date-parts":[["2025",6,17]]},"language":"en","note":"slides: https://coalg.org/calco-mfps-2025/slides/2-Tuesday/4-Session3/1-QuentinAristote.pdf","publisher-place":"Glasgow, Scotland","title":"Active learning of upward-closed sets of words","type":"speech","URL":"https://coalg.org/calco-mfps-2025/calco/"},