In this paper we investigate solvability of the word problem for Extended Modular groups, Extended Hecke groups and Picard groups in terms of complete rewriting systems. At the final part of the paper we examine the other important decision problem (conjugacy problem) for only Extended Modular groups
