Computer Science – Logic in Computer Science
Scientific paper
2008-07-25
LMCS 4 (3:9) 2008
Computer Science
Logic in Computer Science
Scientific paper
10.2168/LMCS-4(3:9)2008
We study rational streams (over a field) from a coalgebraic perspective. Exploiting the finality of the set of streams, we present an elementary and uniform proof of the equivalence of four notions of representability of rational streams: by finite dimensional linear systems; by finite stream circuits; by finite weighted stream automata; and by finite dimensional subsystems of the set of streams.
No associations
LandOfFree
Rational streams coalgebraically 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 Rational streams coalgebraically, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rational streams coalgebraically will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-325723