Rational streams coalgebraically
Logic in Computer Science
2015-07-01 v2
Abstract
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.
Cite
@article{arxiv.0807.4073,
title = {Rational streams coalgebraically},
author = {J. J. M. M. Rutten},
journal= {arXiv preprint arXiv:0807.4073},
year = {2015}
}