111 citations · 528 across the 50 of their papers we have counts for
4 papers · 1 filter
On Star Expressions and Coalgebraic Completeness Theorems
Todd Schmid, Jurriaan Rot, Alexandra Silva
An open problem posed by Milner asks for a proof that a certain axiomatisation, which Milner showed is sound with respect to bisimilarity for regular expressions, is also complete.…
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…
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…
Guarded Kleene Algebra with Tests: Coequations, Coinduction, and Completeness
Todd Schmid, Tobias Kappé, Dexter Kozen +1
Guarded Kleene Algebra with Tests (GKAT) is an efficient fragment of KAT, as it allows for almost linear decidability of equivalence. In this paper, we study the (co)algebraic prop…