Rational Streams Coalgebraically

We study rational streams (over a field) from a coalgebraic perspective. Ex- ploiting 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.

[1]  R. Tennant.  Algebra , 1941, Nature.

[2]  Garrett Birkhoff,et al.  A survey of modern algebra , 1942 .

[3]  Jan J. M. M. Rutten,et al.  Coalgebraic Foundations of Linear Systems , 2007, CALCO.

[4]  Jean Berstel,et al.  Rational series and their languages , 1988, EATCS monographs on theoretical computer science.

[5]  Jan J. M. M. Rutten,et al.  A coinductive calculus of streams , 2005, Mathematical Structures in Computer Science.

[6]  Jan J. M. M. Rutten,et al.  Synthesis of Mealy Machines Using Derivatives , 2006, CMCS.

[7]  Jan Rutten.  Algebra, bitstreams, and circuits , 2005 .

[8]  S. Liberty,et al.  Linear Systems , 2010, Scientific Parallel Computing.

[9]  Alfred J. van der Poorten,et al.  Automatic sequences. Theory, applications, generalizations , 2005, Math. Comput..