Tag systems were defined by Post ,  and have been studied by a number of researchers including Minsky , Maslov  and Aanderaa and Belsnes . In their recent paper Aanderaa and Belsnes demonstrated that every r.e. many-one degree (exclusive of the degree of the empty set) is represented by the general halting problem for tag systems, that is, by the family of halting problems ranging over all tag systems. Their result depends upon an informal proof of this property for Turing machines but may be seen to be correct in light of a formal proof due to Overbeek . Our aim is to extend their results to the general word problem for these systems. Specifically, we shall present an effective method which, when applied to an arbitrary r.e. set S, where S is neither empty nor the set of all natural numbers, produces a tag system R′ whose word and halting problems are both of the same many-one degree as the decision problem for S. The proof is realized by first constructing, from the description of an arbitrary Turing machine M, which machine has at least one mortal and one immortal configuration, a 5-register machine R, whose word and halting problems are both of the same many-one degree as the halting problem for M. From R we then construct the desired tag system R′. This construction combined with Overbeek's  shows that every r.e. many-one degree (exclusive of the degrees of the empty set and the set of all natural numbers) is represented by the general word and halting problems for tag systems. Moreover our results are seen to be best possible with regard to degrees of unsolvability in that it is not the case that every nonrecursive r.e. one-one degree is represented by either of the general decision problems for tag systems which are considered here. These results were first shown in the author's thesis  and were announced in , They form part of an extensive study into the many-one equivalence of general decision problems. An overview of the initial findings of this research project may be found in .