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

DOI10.1142/S1793557109000054MaRDI QIDQ5324145zbMATH OpenOpenAlexFDO

Authors 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

automatoncoalgebratree automaton

Mathematics Subject Classification ID

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

Recommendations

• State-based systems and (F₁,F₂)-coalgebras
• Automata and fixed point logics for coalgebras
• Coalgebras of bounded type
• Membrane Computing
• Coalgebraic Automata Theory: Basic Results

Cites work

• An approach to object semantics based on terminal co-algebras
• Automata and fixed point logics for coalgebras
• Covarieties and complete covarieties
• scientific article; zbMATH DE number 195199 (Why is no real title available?)
• Kategorien und Funktoren. Nach einer Vorlesung von D. Puppe
• Universal coalgebra: A theory of systems

Cited in

(4)

• State-based systems and (F₁,F₂)-coalgebras
• scientific article; zbMATH DE number 4075145 (Why is no real title available?)
• Coalgebras of bounded type
• Membrane Computing

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5324145)