Partially-additive monoids
A generalized minimal realization theory of machines in a category.
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.
The topology of continuous partially-additive monoids
Page 1