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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
