A NOTE ON SUBCATEGORIES OF REACHABLE MACHINES

Abstract

Given a category K. a state-behaviour process X: K → K and an image factorization system (E,M) for K, it is shown that under mild conditions the full subcategory with objects all reachable machines is coreflective. A corresponding result is obtained for coequalizer-reachable machines if X is only an input process.