Well-Pointed Coalgebras

DOI10.2168/LMCS-9(3:2)2013zbMath1272.18002arXiv1305.0576OpenAlexW2002025616MaRDI QIDQ2846574

Jiří Adámek, Stefan Milius, Lawrence S. Moss, Lurdes Sousa

Publication date: 6 September 2013

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.0576

zbMATH Keywords

automatagraphsfinal coalgebrabinary treesiterative algebralabeled transition systemsstreamsinitial algebrawell-founded coalgebrawell-pointed coalgebra

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Abstract data types; algebraic specification (68Q65) Equational categories (18C05) Theories (e.g., algebraic theories), structure, and semantics (18C10)

Related Items (8)

Minimality Notions via Factorization Systems and Examples ⋮ Initial algebras and final coalgebras consisting of nondeterministic finite trace strategies ⋮ Coalgebraic constructions of canonical nondeterministic automata ⋮ Fixed Points of Functors - A Short Abstract ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Coalgebraic View of Bar Recursion and Bar Induction ⋮ A coalgebraic view on reachability

This page was built for publication: Well-Pointed Coalgebras