Copower functors

DOI10.1016/J.TCS.2008.09.057zbMath1173.68042OpenAlexW2912491216MaRDI QIDQ1006640

H. Peter Gumm

Publication date: 25 March 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.09.057

zbMATH Keywords

signature functors

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categories of machines, automata (18B20)

Related Items (3)

Free-lattice functors weakly preserve epi-pullbacks ⋮ A coalgebraic perspective on linear weighted automata ⋮ Hybrid logic with the difference modality for generalisations of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Universal coalgebra: A theory of systems
• Refinement monoids, Vaught monoids, and Boolean algebras
• Equidivisible semigroups
• Types and coalgebraic structure
• Structured transition systems with parametric observations: observational congruences and minimal realizations
• Monoid-labeled transition systems
• Foundations of Software Science and Computational Structures
• Products of abstract algebras

This page was built for publication: Copower functors