In this paper we consider a number of natural decision problems involving k-regular sequences. Specifically, they arise from - lower and upper bounds on growth rate; in particular boundedness, - images, - regularity (recognizability by a deterministic finite automaton) of preimages, and - factors, such as squares and palindromes of such sequences. We show that the decision problems are undecidable.

翻译：在本文中,我们考虑了若干涉及千例序列的自然决定问题。具体地说,这些问题产生于:增长率的下限和上限;特别是前置图像的界限、图像、规律性(确定性的有限自动图)以及此类序列的方形和缓冲等因素。我们表明,这些决定问题是不可估量的。