“…However this case never happens for the directed graph E constructed above, as it has no loops when xx * e or x * x e implies that x e, and has no sink when xx * e implies that x e, for each x ∈ S and e ∈ E, but these two conditions are International Journal of Mathematics and Mathematical Sciences 21 clearly equivalent, and both are equivalent to S E. A concrete example is S N, max with n n * . Also a sufficient condition for E to be cofinal is that S is finitely transitive; namely, for each e, f ∈ E there are finitely many x i ∈ S, 1 ≤ i ≤ n with s x 1 e, r x n f and r x i s x i 1 , for 1 ≤ i ≤ n − 1. Let us say that S is N-transitive if we could always find such a finite path with n ≤ N. A concrete example of a 1-transitive semigroup is the Brandt semigroup B 2 consisting of all pairs i, j , i, j ∈ {0, 1}, plus zero element, with i, j k, l i, l if j k, and zero otherwise.…”