22 citations · 44 across the 8 of their papers we have counts for
4 papers · 1 filter
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…
Separation and Renaming in Nominal Sets
Joshua Moerman, Jurriaan Rot
Nominal sets provide a foundation for reasoning about names. They are used primarily in syntax with binders, but also, e.g., to model automata over infinite alphabets. In this pape…
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…
Fast Computations on Ordered Nominal Sets
David Venhoek, Joshua Moerman, Jurriaan Rot
We show how to compute efficiently with nominal sets over the total order symmetry, by developing a direct representation of such nominal sets and basic constructions thereon. In c…