A new example for minimality of monoids

Abstract

By considering the split extension of a free abelian monoid having finite rank by a finite monogenic monoid, the main purposes of this paper are to present examples of efficient monoids and, also, minimal but inefficient monoids. Although results presented in this paper seem as in the branch of pure mathematics, they are actually related to applications of Combinatorial and Geometric Group-Semigroup Theory, especially computer science, network systems, cryptography and physics etc., which will not be handled here.