Decidability and k-Regular Sequences

dc.contributor.author	Krenn, Daniel
dc.contributor.author	Shallit, Jeffrey
dc.date.accessioned	2022-01-25T18:47:26Z
dc.date.available	2022-01-25T18:47:26Z
dc.date.issued	2020-05
dc.description.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.	en
dc.description.sponsorship	Austrian Science Fund	en
dc.identifier.uri	https://doi.org/10.1016/j.tcs.2022.01.018
dc.identifier.uri	http://hdl.handle.net/10012/17966
dc.language.iso	en	en
dc.publisher	Elsevier	en
dc.relation.ispartofseries	Theoretical Computer Science;
dc.subject	k-regular sequence	en
dc.subject	decidability	en
dc.subject	unsolvability	en
dc.title	Decidability and k-Regular Sequences	en
dc.type	Article	en
dcterms.bibliographicCitation	Krenn, D., & Shallit, J. (2022). Decidability and k-Regular Sequences. Theoretical Computer Science. https://doi.org/10.1016/j.tcs.2022.01.018	en
uws.contributor.affiliation1	Faculty of Mathematics	en
uws.contributor.affiliation2	David R. Cheriton School of Computer Science	en
uws.peerReviewStatus	Reviewed	en
uws.scholarLevel	Faculty	en
uws.typeOfResource	Text	en

Files

Now showing 1 - 1 of 1

Now showing 1 - 1 of 1