On fixed points of rational transductions (Q1637233)

In this short paper, the authors prove that the fixed point problem for injective rational functions is undecidable. A function is called rational, if it can be computed by a transducer (an automaton with outputs). For this, the authors use the undecidability of the Post corresponding problem for injective morphisms and some characterizations of rational transduction functions by Nivat and Latteux-Leguy. As a corollary, it is shown that the fixed point problem is undecidable for injective computable functions (on natural numbers).