- F. P. Brooks, Jr. and K. E. Iverson, Automatic Data Processing, Chapter 7, John Wiley, 1963.Google Scholar
- K. Sparks Jones and R. M. Needham, Automatic Term Classification and Retrieval Information Storage and Retrieval, Vol. 4, No. 2, June, 1968, Pages 91--100.Google ScholarCross Ref
- Harary, Norman and Cartwright, Structural Models, John Wiley, 1965.Google Scholar
- König, Theorie der endlichen und unendlichen Graphen Leipzig: Akademische Verlagsgesellschaft, 1936.Google Scholar
- J. J. Martin, Information Compressing by String Pattern Analysis, Proceedings of the third Hawaii International Conference on System Sciences, 1970, Part 2, Pages 781--784.Google Scholar
Recommendations
About the fundamental relations defined on the hypergroupoids associated with binary relations
This paper deals with connections between hypergroupoids and n-ary relations. First we prove that the study of the reduced hypergroupoids associated with n-ary relations can be linked to the simpler case of binary relations. On the basis of the ...
n-hypergroups and binary relations
In this paper, we introduce and study the notion of a partial n-hypergroupoid, associated with a binary relation. Some important results concerning Rosenberg partial hypergroupoids, induced by relations, are generalized to the case of n-hypergroupoids. ...
Binary relations and reduced hypergroups
Different partial hypergroupoids are associated with binary relations defined on a set H. In this paper we find sufficient and necessary conditions for these hypergroupoids in order to be reduced hypergroups. Given two binary relations @r and @s on H we ...
Comments