Closure Properties of Coalgebra Automata

Authors:
Clemens Kupke
Affiliations:
Universiteit van Amsterdam
Venue:
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Year:
2005

Citing 0
Cited 4

Coalgebras and their logics

ACM SIGACT News
Automata and fixed point logic: a coalgebraic perspective

Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Automata and fixed point logic: A coalgebraic perspective

Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Modal logics are coalgebraic

VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

We generalize some of the central results in automata theory to the abstraction level of coalgebras. In particular, we show that for any standard, weak pullback preserving functor F, the class of recognizable languages of F-coalgebras is closed under taking unions, intersections and projections. Our main technical result concerns a construction which transforms a given alternating F-automaton into an equivalent non-deterministic one.