7 citations · 26 across the 5 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.FL2021★ 5 cited
Canonical Automata via Distributive Law Homomorphisms
Stefan Zetzsche, Gerco van Heerdt, Matteo Sammartino +1
The classical powerset construction is a standard method converting a non-deterministic automaton into a deterministic one recognising the same language. Recently, the powerset con…
cs.FL2021★ 7 cited
Learning Pomset Automata
Gerco van Heerdt, Tobias Kappé, Jurriaan Rot +1
We extend the L* algorithm to learn bimonoids recognising pomset languages. We then identify a class of pomset automata that accepts precisely the class of pomset languages recogni…