Complementation of Coalgebra Automata

DOI10.1007/978-3-642-03741-2_7zbMath1239.68048OpenAlexW1664983908MaRDI QIDQ2888479

Christian Kissig, Yde Venema

Publication date: 1 June 2012

Published in: Algebra and Coalgebra in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03741-2_7

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70)

Related Items (max. 100)

Equivalences and Congruences on Infinite Conway Games ⋮ Cooking Your Own Parity Game Preorders Through Matching Plays ⋮ Generic weakest precondition semantics from monads enriched with order ⋮ Proof systems for Moss' coalgebraic logic ⋮ Coalgebraic semantics of modal logics: an overview ⋮ Generalised powerlocales via relation lifting ⋮ Unnamed Item

Cites Work

• Alternating automata on infinite trees
• Universal coalgebra: A theory of systems
• Extensive games as process models
• Automata and fixed point logic: a coalgebraic perspective
• Coalgebraic Automata Theory: Basic Results
• Unnamed Item
• Unnamed Item

This page was built for publication: Complementation of Coalgebra Automata