Abstract.Necessary and sufficient conditions on a monoid M are found in order that M be isomorphic to the syntactic monoid of a language L over an alphabet X having one of the following properties. In the first theorem L is a /¿-class and Pw¡¡\ Q PL where PL is the syntactic congruence of L and W(L) is the residue of L . In the second theorem L is an infix code; that is, satisfies u, uvw 6 L implying u = w = I . In the third theorem L is an infix code satisfying a condition which amounts to the requirement that M be a nilmonoid. Various refinements of these conditions are also considered.