algorithms for determining the type of algebraic hyperstructures and morphisms

In this paper, we present some primary methods to define a hypergroupoid by algorithm. then, we present algorithms for checking if it is closed under ο, associativity, weak associativity, commutativity, weak commutativity, establishing the reproduction axiom, determining the type of a hypergroupoid  (h,ο) and the type of a morphism f in a hypergroupoid (h,ο). the goal of this paper is to provide algorithms for checking the basic features and morphisms in algebraic hyperstructures. our attention is on algorithms for algebraic hyperstructures with one hyperoperation (i.e. hypergroupoids). the algorithms can be developed for other algebraic hyperstructures.