-
30 September 2008
-
2:30 - 4:00 Brendan Cordy
Constructing Final Coalgebras with Modal Logic
Abstract:
Using modal logic, we can construct final coalgebras for
some well known functors in the coalgebraic theory of automata without
mention of the final sequence typically used in a such
constructions. This logical description of the final coalgebra lends
itself to applications in machine learning, such as reconstructing
automata from partial data about their behaviour.