22 citations · 44 across the 8 of their papers we have counts for
Showing 2019 · cs.FLShow all
2 papers · 2 filters
cs.FL2019★ 1 cited
Residuality and Learning for Nondeterministic Nominal Automata
Joshua Moerman, Matteo Sammartino
We are motivated by the following question: which data languages admit an active learning algorithm? This question was left open in previous work by the authors, and is particularl…
cs.FL2019★ 3 cited
A (co)algebraic theory of succinct automata
Gerco van Heerdt, Joshua Moerman, Matteo Sammartino +1
The classical subset construction for non-deterministic automata can be generalized to other side-effects captured by a monad. The key insight is that both the state space of the d…