Noncommutative minimization algorithms
Information Processing Letters
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Towards a Mathematical Operational Semantics
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Behavioural differential equations: a coinductive calculus of streams, automata, and power series
Theoretical Computer Science
Free iterative theories: a coalgebraic view
Mathematical Structures in Computer Science
On the final sequence of a finitary set functor
Theoretical Computer Science
Mathematical Structures in Computer Science
Bisimulation relations for weighted automata
Theoretical Computer Science
Axiomatizing rational power series over natural numbers
Information and Computation
Coalgebraic logic and synthesis of mealy machines
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Semantics of higher-order recursion schemes
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
A Sound and Complete Calculus for Finite Stream Circuits
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Quantitative Kleene coalgebras
Information and Computation
Simulations of weighted tree automata
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Multi-Linear Iterative K-Σ-Semialgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Algebra-coalgebra duality in brzozowski's minimization algorithm
ACM Transactions on Computational Logic (TOCL)
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
Coalgebras provide a uniform framework for studying dynamical systems, including several types of automata. In this article, 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 generalized powerset construction that determinizes 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 FT, where T 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 determinized type functor F, a lifting of F to the category of T-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 nondeterministic automata in which we recover Rabinovich’s sound and complete calculus for language equivalence.