Given an i.i.d. sequence of n letters from a finite alphabet, we consider the length of the longest run of any letter. In the equiprobable case, results for this run turn out to be closely related to the well-known results for the longest run of a given letter. For coin-tossing, tail probabilities are compared for both kinds of runs via Poisson approximation.

This paper continues the study of the connection between hyper- groups and fuzzy sets, investigating the length of the sequence of join spaces associated with a hypergroup. The classes of complete hypergroups and of 1-hypergroups are considered and analyzed in this context. Finally, we give a method to construct a nite hypergroup with the strong fuzzy grade equal to a given natural number

this paper continues the study of the connection between hyper- groups and fuzzy sets, investigating the length of the sequence of join spaces associated with a hypergroup. the classes of complete hypergroups and of 1-hypergroups are considered and analyzed in this context. finally, we give a method to construct a nite hypergroup with the strong fuzzy grade equal to a given natural number