40 citations · 156 across the 43 of their papers we have counts for
7 papers · 1 filter
Learning Automata with Name Allocation
Florian Frank, Stefan Milius, Jurriaan Rot +1
Automata over infinite alphabets have emerged as a convenient computational model for processing structures involving data, such as nonces in cryptographic protocols or data values…
Complete Test Suites for Automata in Monoidal Closed Categories
Bálint Kocsis, Jurriaan Rot
Conformance testing of automata is about checking the equivalence of a known specification and a black-box implementation. An important notion in conformance testing is that of a c…
A New Approach for Active Automata Learning Based on Apartness
Frits Vaandrager, Bharat Garhewal, Jurriaan Rot +1
We present , a new and simple approach to active automata learning. Instead of focusing on equivalence of observations, like the algorithm and its descendants, $…
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…
A Categorical Framework for Learning Generalised Tree Automata
Gerco van Heerdt, Tobias Kappé, Jurriaan Rot +2
Automata learning is a popular technique used to automatically construct an automaton model from queries. Much research went into devising ad hoc adaptations of algorithms for diff…
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…