Conference paper
Addressable data graphs
Arnold L. Rosenberg
POPL 1971
Previous characterizations of the class of addressable data graphs have been intrinsic in nature. In this note, the auxiliary concept of a monoid system is used to derive an extrinsic characterization of the class. Specifically, a partial transformation of the class of data graphs is found which fixes (up to isomorphism) precisely the addressable data graphs. © 1974.
Arnold L. Rosenberg
POPL 1971
Arnold L. Rosenberg, Larry J. Stockmeyer
Acta Informatica
Arnold L. Rosenberg
Information and Control
Arnold L. Rosenberg, Lawrence Snyder
Mathematical Systems Theory