57 citations · 208 across the 27 of their papers we have counts for
5 papers · 1 filter
Unambiguous Acceptance of Thin Coalgebras
Anton Chernev, Corina Cîrstea, Helle Hvid Hansen +1
Automata admitting at most one accepting run per structure, known as unambiguous automata, find applications in verification of reactive systems as they extend the class of determi…
Thin Coalgebraic Behaviours Are Inductive
Anton Chernev, Corina Cîrstea, Helle Hvid Hansen +1
Coalgebras for analytic functors uniformly model graph-like systems where the successors of a state may admit certain symmetries. Examples of successor structure include ordered tu…
Dual Adjunction Between -Automata and Wilke Algebra Quotients
Anton Chernev, Helle Hvid Hansen, Clemens Kupke
-automata and Wilke algebras are formalisms for characterising -regular languages via their ultimately periodic words. -automata read finite representations of ultimately…
Minimisation in Logical Form
Nick Bezhanishvili, Marcello Bonsangue, Helle Hvid Hansen +4
Stone-type dualities provide a powerful mathematical framework for studying properties of logical systems. They have recently been fruitfully explored in understanding minimisation…
Learning Weighted Automata over Principal Ideal Domains
Gerco van Heerdt, Clemens Kupke, Jurriaan Rot +1
In this paper, we study active learning algorithms for weighted automata over a semiring. We show that a variant of Angluin's seminal \LStar\ algorithm works when the semiring is a…