Zetzsche, S; Silva, A; Sammartino, M; (2023) Generators and Bases for Monadic Closures. In: Proceedings of the 10th Conference on Algebra and Coalgebra in Computer Science (CALCO 2023). (pp. pp. 1-19). Schloss Dagstuhl Leibniz-Zentrum für Informatik: Dagstuhl, Germany.

Preview

PDF LIPIcs-CALCO-2023-11.pdf - Published Version Download (828kB) | Preview

Abstract

It is well-known that every regular language admits a unique minimal deterministic acceptor. Establishing an analogous result for non-deterministic acceptors is significantly more difficult, but nonetheless of great practical importance. To tackle this issue, a number of sub-classes of nondeterministic automata have been identified, all admitting canonical minimal representatives. In previous work, we have shown that such representatives can be recovered categorically in two steps. First, one constructs the minimal bialgebra accepting a given regular language, by closing the minimal coalgebra with additional algebraic structure over a monad. Second, one identifies canonical generators for the algebraic part of the bialgebra, to derive an equivalent coalgebra with side effects in a monad. In this paper, we further develop the general theory underlying these two steps. On the one hand, we show that deriving a minimal bialgebra from a minimal coalgebra can be realized by applying a monad on an appropriate category of subobjects. On the other hand, we explore the abstract theory of generators and bases for algebras over a monad.

Download activity - last month

Export as XMLCSVJSON

Download activity - last 12 months

Export as XMLCSVJSON

Downloads by country - last 12 months

Export as JSONXMLCSV

Archive Staff Only

View Item