3 papers
cs.FL2026
Unambiguous Acceptance of Thin Coalgebras
Anton Chernev, Corina Cîrstea, Helle Hvid Hansen +1
Automata admitting at most one accepting run per structure, known as unambiguous automata, find applications in verification of reactive systems as they extend the class of determi…
cs.FL2025
Thin Coalgebraic Behaviours Are Inductive
Anton Chernev, Corina Cîrstea, Helle Hvid Hansen +1
Coalgebras for analytic functors uniformly model graph-like systems where the successors of a state may admit certain symmetries. Examples of successor structure include ordered tu…
cs.FL2024
Dual Adjunction Between -Automata and Wilke Algebra Quotients
Anton Chernev, Helle Hvid Hansen, Clemens Kupke
-automata and Wilke algebras are formalisms for characterising -regular languages via their ultimately periodic words. -automata read finite representations of ultimate…