Coalgebraic Automata Theory: Basic Results

Abstract. We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata operating on infinite objects. Let F be any set functor that preserves weak pullbacks. We show that the class of recognizable languages of F-coalgebras is closed under taking unions, intersections, and projections. We also prove that if an F-automaton accepts some coalgebra it accepts a finite one of the size of the automaton. Our main technical result concerns an explicit construction which transforms a given alternating F-automaton into an equivalent nondeterministic one, of bounded size.

• Type: Journal
• Year: 2008
• Where: CORR
• Authors: Clemens Kupke, Yde Venema
• Keywords: Abstraction Level, Automata Operating, Automata Theory, CORR 2008, Education