AUTOMATA AND TREE AUTOMATA AS (F1, F2)-COALGEBRAS

DOI10.1142/S1793557109000054zbMath1186.08002OpenAlexW2062378604MaRDI QIDQ5324145

Klaus Denecke

Publication date: 3 August 2009

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793557109000054

zbMATH Keywords

coalgebraautomatontree automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Applications of universal algebra in computer science (08A70) Algebraic theory of languages and automata (68Q70) Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30) Categories of machines, automata (18B20)

Cites Work

• Unnamed Item
• Unnamed Item
• Universal coalgebra: A theory of systems
• Kategorien und Funktoren. Nach einer Vorlesung von D. Puppe
• An approach to object semantics based on terminal co-algebras
• Covarieties and complete covarieties

This page was built for publication: AUTOMATA AND TREE AUTOMATA AS (F₁, F₂)-COALGEBRAS