Ciobanu, Laura Houcine, Abderezak Ould 2010-04-15 Let <i>F</i> be a free group of finite rank. We say that the monomorphism problem in <i>F</i> is decidable if there is an algorithm such that, for any two elements <i>u</i> and <i>v</i> in <i>F</i>, it determines whether there exists a monomorphism of <i>F</i> that sends <i>u</i> to <i>v</i>. In this paper we show that the monomorphism problem is decidable and we provide an effective algorithm that solves the problem. application/pdf https://folia.unifr.ch/global/documents/301736 https://folia.unifr.ch/documents/301736/files/Arch_mat.pdf eng info:eu-repo/semantics/altIdentifier/doi/10.1007/s00013-010-0118-0 info:eu-repo/semantics/openAccess License undefined Archiv der Mathematik. - 2010, vol. 94, no. 5, p. 423-434 Free groups Decision problems Complexity of algorithms info:eu-repo/classification/udc/51 The monomorphism problem in free groups http://purl.org/coar/resource_type/c_6501