3 citations · 3 across the 1 of their papers we have counts for
3 papers
cs.LO2019
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…
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…
cs.SE2017
Learning Product Automata
Joshua Moerman
In this paper we give an optimization for active learning algorithms, applicable to learning Moore machines where the output comprises several observables. These machines can be de…