Braids: generalizations, presentations and algorithmic properties

Classical braid groups admit several types of presentations. The analogues of these presentations are obtained for the genralizations of braid groups. Garside algorithm for the word problem also works for the singular braid monoid.