2019-03-08: Clemens Kupke (MSP)

Tue, 14 Oct 2025 16:51:42 +0000

Clemens Kupke (MSP)

Coalgebra Learning via Duality

Abstract

A key result in computational learning theory is Dana Angluin's L* algorithm that describes how to learn a deterministic finite automaton (DFA) using membership and equivalence queries. I will present a generalisation of this algorithm to the level of coalgebras. The approach relies on the use of logical formulas as tests, based on a dual adjunction between states and logical theories. This allows us to learn, e.g., labelled transition systems, using modal formulas as tests.

Joint work with Simone Barlocco and Jurriaan Rot.

2019-03-08 16:00:00 UTC
LT1415