Patrick C. Fischer, Arnold L. Rosenberg
Journal of Computer and System Sciences
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.
Patrick C. Fischer, Arnold L. Rosenberg
Journal of Computer and System Sciences
Arnold L. Rosenberg
STOC 1970
Raymond E. Miller, Arnold L. Rosenberg
International Journal of Computer Mathematics
Patrick C. Fischer, Albert R. Meyer, et al.
Mathematical Systems Theory