Coalgebra automata are finite automata that operate on (possibly) infinite objects which are represented as pointed coalgebras. Examples from the literature such as automata on infinite words, trees and graphs can be seen as coalgebra automata.

In my talk I will first recall the definition of a coalgebra automaton. Then …

read more