Coalgebraic Automata Theory: Basic Results

DOI10.2168/LMCS-4(4:10)2008MaRDI QIDQ3623006zbMATH OpenFDO

Authors Clemens Kupke, Yde Venema

Publication date 29 April 2009

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

Full work available at URL https://doi.org/10.2168/LMCS-4(4:10)2008

zbMATH Keywords

automatacoalgebrasfixed-point logicparity games

Mathematics Subject Classification ID

Categories of machines, automata (18B20) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Recommendations

• scientific article; zbMATH DE number 1304993
• Automata and fixed point logics for coalgebras
• Automata and fixed point logic: a coalgebraic perspective
• Complementation of coalgebra automata
• Automata for coalgebras: an approach using predicate liftings
• Generalizing determinization from automata to coalgebras
• Coalgebraic constructions of canonical nondeterministic automata
• Coalgebraic Semantics of Heavy-Weighted Automata
• CSP, partial automata, and coalgebras.
• Coalgebraic semantics for nominal automata

Cited in

(39)

• Coalgebraic minimization of automata by initiality and finality
• Coalgebraic logics \& duality
• A (co)algebraic theory of succinct automata
• Automata and fixed point logic: a coalgebraic perspective
• Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus
• Coalgebraic Semantics of Heavy-Weighted Automata
• Equational coalgebraic logic
• Two-Way Automata in Coq
• Automata and fixed point logics for coalgebras
• Complementation of coalgebra automata
• Generalizing the powerset construction, coalgebraically
• Stream Automata Are Coalgebras
• Lifting adjunctions to coalgebras to (re)discover automata constructions
• Sound and complete axiomatizations of coalgebraic language equivalence
• Generic Partition Refinement Algorithms for Coalgebras and an Instantiation to Weighted Automata
• Automata for coalgebras: an approach using predicate liftings
• A Kleene Theorem for Polynomial Coalgebras
• scientific article; zbMATH DE number 4075145 (Why is no real title available?)
• Proof systems for Moss' coalgebraic logic
• Modalities in the Stone age: a comparison of coalgebraic logics
• scientific article; zbMATH DE number 1304993 (Why is no real title available?)
• scientific article; zbMATH DE number 1759443 (Why is no real title available?)
• Some model theory for the modal \(\mu\)-calculus: syntactic characterisations of semantic properties
• scientific article; zbMATH DE number 6851946 (Why is no real title available?)
• Generalizing determinization from automata to coalgebras
• A coalgebraic take on regular and -regular behaviours
• Moss' logic for ordered coalgebras
• Toward a uniform theory of effectful state machines
• scientific article; zbMATH DE number 7410353 (Why is no real title available?)
• AUTOMATA AND TREE AUTOMATA AS (F₁, F₂)-COALGEBRAS
• scientific article; zbMATH DE number 7649888 (Why is no real title available?)
• Coalgebras for Bisimulation of Weighted Automata over Semirings
• Subsequential transducers: a coalgebraic perspective
• Completeness for flat modal fixpoint logics
• Coalgebraic semantics of modal logics: an overview
• On the size of disjunctive formulas in the \(\mu\)-calculus
• Unambiguous acceptance of thin coalgebras
• Generic weakest precondition semantics from monads enriched with order
• Coalgebraic constructions of canonical nondeterministic automata

This page was built for publication: Coalgebraic Automata Theory: Basic Results

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