On fixed points of rational transductions

We show that it is undecidable whether or not an injective rational function (realized by a finite transducer) f:A⁎→A⁎ has a fixed point. The proof applies undecidability of the Post's Correspondence Problem for injective morphisms. As a corollary we obtain that the existence of a fixed point of injective computable functions is undecidable.