algorithms for finding specific elements in algebraic‎ ‎hyperstructures‎ ‎with‎ ‎one hyperoperation

‎in this paper‎, ‎first‎, ‎we show how to define an algebraic hyperstructure by using algorithms‎. ‎then‎, ‎we present algorithms that calculate specific elements in algebraic hyperstructures‎. ‎these specific elements are‎: ‎scalars‎, ‎scalar identities‎, ‎identities‎, ‎inverses‎, ‎zero elements‎, ‎right simplifiable elements‎, ‎left simplifiable elements‎, ‎left absorbing-like elements and right absorbing-like elements‎. ‎we also introduce some algorithms in algebraic hyperstructures to check properties or calculate specific members‎. ‎these algorithms are presented for algebraic hyperstructures with one hyperoperation‎, ‎i.e‎. ‎hypergroupoids‎. ‎however‎, ‎they can be developed for other algebraic hyperstructures‎.