This paper presents a generalized minimal realization theory of machines in a category which contains the Kleiski case. The minimal realization is the cheapest realization for a given cost functor. The final reachable realization of Arbib and Manes ([5]) and the minimal state approach for nondeterministic machines are included here.
@article{urn:eudml:doc:38876,
title = {A generalized minimal realization theory of machines in a category.},
journal = {Stochastica},
volume = {7},
year = {1983},
pages = {17-28},
zbl = {0558.68048},
mrnumber = {MR0766888},
language = {en},
url = {http://dml.mathdoc.fr/item/urn:eudml:doc:38876}
}
Bahamonde, Antonio. A generalized minimal realization theory of machines in a category.. Stochastica, Tome 7 (1983) pp. 17-28. http://gdmltest.u-ga.fr/item/urn:eudml:doc:38876/