Coalgebraic Automata Theory: Basic Results

Details Coalgebraic Automata Theory: Basic Results Coalgebraic Automata Theory: Basic Results

2008-11-12

arxiv.org/abs/0811.1976v2

LMCS 4 (4:10) 2008

Computer Science

Logic in Computer Science

43 pages

Scientific paper

10.2168/LMCS-4(4:10)2008

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 a nondeterministic 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, whose size is exponentially bound by the size of the original automaton.

Affiliated with

Also associated with

No associations

Rating

Coalgebraic Automata Theory: Basic Results does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Coalgebraic Automata Theory: Basic Results, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Coalgebraic Automata Theory: Basic Results will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-101513