34 citations · 174 across the 26 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.AI2021
Lecture Notes on Partially Known MDPs
Guillermo A. Perez
In these notes we will tackle the problem of finding optimal policies for Markov decision processes (MDPs) which are not fully known to us. Our intention is to slowly transition fr…
cs.FL2021
Active Learning of Sequential Transducers with Side Information about the Domain
Raphaël Berthon, Adrien Boiret, Guillermo A. Perez +1
Active learning is a setting in which a student queries a teacher, through membership and equivalence queries, in order to learn a language. Performance on these algorithms is ofte…
cs.FL2021
Continuous One-Counter Automata
Michael Blondin, Tim Leys, Filip Mazowiecki +2
We study the reachability problem for continuous one-counter automata, COCA for short. In such automata, transitions are guarded by upper and lower bound tests against the counter…