On minimal coalgebras

DOI10.1007/s10485-007-9116-1zbMath1144.18002OpenAlexW2097456817MaRDI QIDQ934670

H. Peter Gumm

Publication date: 30 July 2008

Published in: Applied Categorical Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10485-007-9116-1

zbMATH Keywords

modal logiccoalgebraproductscoalgebraic logicminimal coalgebraMoore-automata

Mathematics Subject Classification ID

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

Related Items

Minimality Notions via Factorization Systems and Examples, Subsequential transducers: a coalgebraic perspective, Complete sets of cooperations, Some facets of Horn covarieties in a category

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Expressive logics for coalgebras via terminal sequence induction
• Universal coalgebra: A theory of systems
• Products of coalgebras.
• A simplification functor for coalgebras
• Types and coalgebraic structure
• Algebraic laws for nondeterminism and concurrency
• The Category-Theoretic Solution of Recursive Domain Equations
• Implementing collection classes with monads
• Coalgebras of bounded type
• Algebra and Coalgebra in Computer Science
• Foundations of Software Science and Computational Structures