Trees in Coalgebra from Generalized Reachability

Thorsten Wißmann, Bálint Kocsis, Jurriaan Rot +1

An automaton is called reachable if every state is reachable from the initial state. This notion has been generalized coalgebraically in two ways: first, via a universal property o…