Search

In the hypecompositional structures, unlike the classical ones, there exist several types of identities. This paper deals with two main types of identities, the scalar and strong ones and with the hypergroups in which they appear. Certain such hypergroups e.g. the fortified join hypergroup and the join polysymmetric hypergroup derived from the theory of formal languages and automata. [ABSTRACT FROM AUTHOR]

The paths in a tree define a hypercomposition in the set of its vertices and so a hypergroup is associated to each tree. Hypergroups are also associated to graphs through their spanning trees. Furthermore hypergroups are associated to automata using hypercompositions defined through strings. [ABSTRACT FROM AUTHOR]

External operations and hyperoperations on hypergroups leads to structures that are called hypermodules, supermodules, hypermoduloids and supermoduloids. These structures give applications in the theory of graphs and in geometries. [ABSTRACT FROM AUTHOR]