2 citations · 2 across the 4 of their papers we have counts for
Showing cs.FLShow all
3 papers · 1 filter
cs.FL2025★ 2 cited
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…
cs.FL2025
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…
cs.FL2024
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…