5 papers
Profunctorial algebras
Quentin Aristote, Umberto Tarantino
We provide a bicategorical generalization of Barr's landmark 1970 paper, in which he describes how to extend Set-monads to relations and uses this to characterize topological space…
Active Learning of Deterministic Transducers with Outputs in Arbitrary Monoids
Quentin Aristote
We study monoidal transducers, transition systems arising as deterministic automata whose transitions also produce outputs in an arbitrary monoid, for instance allowing outputs to…
Active Learning of Upward-Closed Sets of Words
Quentin Aristote
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…
Monotone weak distributive laws over the lifted powerset monad in categories of algebras
Quentin Aristote
Noticing the similarity between the monotone weak distributive laws combining two layers of nondeterminism in sets and in compact Hausdorff spaces, we study whether the latter law…
Learning Weighted Automata over Number Rings, Concretely and Categorically
Quentin Aristote, Sam van Gool, Daniela PetriÅan +1
We develop a generic reduction procedure for active learning problems. Our approach is inspired by a recent polynomial-time reduction of the exact learning problem for weighted aut…