@article{KRENN202234,
Abstract = {In this paper we consider a number of natural decision problems involving k-regular sequences. Specifically, they arise from considering*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 these decision problems are undecidable.},
Author = {Krenn, Daniel and Shallit, Jeffrey},
File = {Decidability and k-regular sequences - 1-s2.0-S030439752200041X-main - n.pdf},
ISSN = {0304-3975},
Journal = {Theoretical Computer Science},
Keywords = {-regular sequence, Decidability, Unsolvability},
Pages = {34-44},
Title = {Decidability and k-regular sequences},
URL = {https://www.sciencedirect.com/science/article/pii/S030439752200041X},
Volume = {907},
Year = {2022},
bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S030439752200041X},
bdsk-url-2 = {https://doi.org/10.1016/j.tcs.2022.01.018},
date-added = {2022-03-29 19:25:03 +0200},
date-modified = {2022-03-29 19:25:03 +0200},
file-2 = {DECIDABILITY AND k-REGULAR SEQUENCES - 2005.09507 - n.pdf},
doi = {10.1016/j.tcs.2022.01.018}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A