Let $S \in \mathbb{Z}\langle\langle A\rangle\rangle$ be a rational series in noncommutative variables. The support of $S$ is the set of all words $u \in A^*$ such that $(S, u) \not= 0$. It is undecidable to know whether the support of a given$^*$ rational series is cofinite (respectively equal to $A^*$). However, it is decidable whether the support is finite (respectively empty). See the exercises of Chapter III in [1].

Question: is it decidable whether the support of a given rational series is a rational (= regular) language?

[1] J. Berstel and C. Reutenauer, Noncommutative rational series with applications. Encyclopedia of Mathematics and its Applications, 137. Cambridge University Press, Cambridge, 2011. xiv+248 pp. ISBN: 978-0-521-19022-0

(*) The rational series can be given by a weighted automaton or by a finite linear representation.