In this paper, we recall the Fibonacci groups defined by the presentat
ions [a1, a2, ..., a(n): a1a2 ... a(r) = a(r+1), a2a3 ... a(r+1) = a(r
+2), ..., a(n-1)a(n)a1 ... a(r-2) = a(r-1), a(n)a1a2 ... a(r-1) = a(r)
], and determine the relationship between these groups and the semigro
ups defined by these presentations. We also consider the more general
situation where we have the presentations [a1,a2, ..., a(n): a1a2... a
(r) = a(r+k), a2a3 ... a(r+1) = a(r+k+1), ,,, a(n-1)a(n)a1 ... a(r-2)
= a(r+k-2), a(n)a1a2 ... a(r-1) = a(r+k-1)].