5 citations · 9 across the 7 of their papers we have counts for
7 papers
Well-Behaved (Co)algebraic Semantics of Regular Expressions in Dafny
Stefan Zetzsche, Wojciech Rozowski
Regular expressions are commonly understood in terms of their denotational semantics, that is, through formal languages -- the regular languages. This view is inductive in nature:…
Canonical Algebraic Generators in Automata Learning
Stefan Zetzsche
Many methods for the verification of complex computer systems require the existence of a tractable mathematical abstraction of the system, often in the form of an automaton. In rea…
Generalised Duality Theory for Monoidal Categories and Applications
Stefan Zetzsche
We discuss generalised duality theory for monoidal categories and its applications to the categories of exact endofunctors, graded vector spaces, and topological vector spaces.
Isomorphism Classes of Vertex-Transitive Tournaments
Stefan Zetzsche
Tournaments are graphs obtained by assigning a direction for every edge in an undirected complete graph. We give a formula for the number of isomorphism classes of vertex-transitiv…
Guarded Kleene Algebra with Tests: Automata Learning
Stefan Zetzsche, Alexandra Silva, Matteo Sammartino
Guarded Kleene Algebra with Tests (GKAT) is the fragment of Kleene Algebra with Tests (KAT) that arises by replacing the union and iteration operations of KAT with predicate-guarde…
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…
Generators and Bases for Monadic Closures
Stefan Zetzsche, Alexandra Silva, Matteo Sammartino
It is well-known that every regular language admits a unique minimal deterministic acceptor. Establishing an analogous result for non-deterministic acceptors is significantly more…