17 research outputs found
Proper Functors and Fixed Points for Finite Behaviour
The rational fixed point of a set functor is well-known to capture the
behaviour of finite coalgebras. In this paper we consider functors on algebraic
categories. For them the rational fixed point may no longer be fully abstract,
i.e. a subcoalgebra of the final coalgebra. Inspired by \'Esik and Maletti's
notion of a proper semiring, we introduce the notion of a proper functor. We
show that for proper functors the rational fixed point is determined as the
colimit of all coalgebras with a free finitely generated algebra as carrier and
it is a subcoalgebra of the final coalgebra. Moreover, we prove that a functor
is proper if and only if that colimit is a subcoalgebra of the final coalgebra.
These results serve as technical tools for soundness and completeness proofs
for coalgebraic regular expression calculi, e.g. for weighted automata
Recursive Program Schemes and Context-Free Monads
AbstractSolutions of recursive program schemes over a given signature Σ were characterized by Bruno Courcelle as precisely the context-free (or algebraic) Σ-trees. These are the finite and infinite Σ-trees yielding, via labelling of paths, context-free languages. Our aim is to generalize this to finitary endofunctors H of general categories: we construct a monad CH “generated” by solutions of recursive program schemes of type H, and prove that this monad is ideal. In case of polynomial endofunctors of Set our construction precisely yields the monad of context-free Σ-trees of Courcelle. Our result builds on a result by N. Ghani et al on solutions of algebraic systems
Corecursive Algebras, Corecursive Monads and Bloom Monads
An algebra is called corecursive if from every coalgebra a unique
coalgebra-to-algebra homomorphism exists into it. We prove that free
corecursive algebras are obtained as coproducts of the terminal coalgebra
(considered as an algebra) and free algebras. The monad of free corecursive
algebras is proved to be the free corecursive monad, where the concept of
corecursive monad is a generalization of Elgot's iterative monads, analogous to
corecursive algebras generalizing completely iterative algebras. We also
characterize the Eilenberg-Moore algebras for the free corecursive monad and
call them Bloom algebras
Well-Pointed Coalgebras
For endofunctors of varieties preserving intersections, a new description of
the final coalgebra and the initial algebra is presented: the former consists
of all well-pointed coalgebras. These are the pointed coalgebras having no
proper subobject and no proper quotient. The initial algebra consists of all
well-pointed coalgebras that are well-founded in the sense of Osius and Taylor.
And initial algebras are precisely the final well-founded coalgebras. Finally,
the initial iterative algebra consists of all finite well-pointed coalgebras.
Numerous examples are discussed e.g. automata, graphs, and labeled transition
systems
Sound and complete axiomatizations of coalgebraic language equivalence
Coalgebras provide a uniform framework to study dynamical systems, including
several types of automata. In this paper, we make use of the coalgebraic view
on systems to investigate, in a uniform way, under which conditions calculi
that are sound and complete with respect to behavioral equivalence can be
extended to a coarser coalgebraic language equivalence, which arises from a
generalised powerset construction that determinises coalgebras. We show that
soundness and completeness are established by proving that expressions modulo
axioms of a calculus form the rational fixpoint of the given type functor. Our
main result is that the rational fixpoint of the functor , where is a
monad describing the branching of the systems (e.g. non-determinism, weights,
probability etc.), has as a quotient the rational fixpoint of the
"determinised" type functor , a lifting of to the category of
-algebras. We apply our framework to the concrete example of weighted
automata, for which we present a new sound and complete calculus for weighted
language equivalence. As a special case, we obtain non-deterministic automata,
where we recover Rabinovich's sound and complete calculus for language
equivalence.Comment: Corrected version of published journal articl