Deciding the point-to-fixed-point problem for skew tent maps on an interval (Q2208250)

This paper considers a family of skew tent maps \(f_a:[0,1] \rightarrow [0,1]\) where \(a \in (0,1)\). The author's main result is that there is a decision procedure to algorithmically decide for a given pair \(a, x_0 \in \mathbb{Q}\) whether \(f_a^n(x_0)\) is a fixed point of \(f_a\) for some \(n \in \mathbb{N}\). Similar types of problems were studied in [\textit{V. D. Blondel} et al., Theor. Comput. Sci. 255, No. 1--2, 687--696 (2001; Zbl 0973.68067); \textit{P. Koiran} et al., Theor. Comput. Sci. 132, No. 1--2, 113--128 (1994; Zbl 0821.68053)].