2 papers
cs.LO2026
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…
cs.FL2025
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…