Decidability and k-regular sequences
نویسندگان
چکیده
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 deterministic finite automaton) preimages, factors, such as squares palindromes We show that the are undecidable.
منابع مشابه
Discriminators and k-Regular Sequences
The discriminator of an integer sequence s = (s(i))i≥0, introduced by Arnold, Benkoski, and McCabe in 1985, is the map Ds(n) that sends n ≥ 1 to the least positive integer m such that the n numbers s(0), s(1), . . . , s(n − 1) are pairwise incongruent modulo m. In this note we consider the discriminators of a certain class of sequences, the k-regular sequences. We compute the discriminators of ...
متن کاملP-adic Valuations and K-regular Sequences
Abstract A sequence is said to be k-automatic if the nth term of this sequence is generated by a finite state machine with n in base k as input. Regular sequences were first defined by Allouche and Shallit as a generalization of automatic sequences. Given a prime p and a polynomial f(x) ∈ Qp[x], we consider the sequence {vp(f(n))}n=0, where vp is the p-adic valuation. We show that this sequence...
متن کاملNote on regular and coregular sequences
Let R be a commutative Noetherian ring and let M be a nitely generated R-module. If I is an ideal of R generated by M-regular sequence, then we study the vanishing of the rst Tor functors. Moreover, for Artinian modules and coregular sequences we examine the vanishing of the rst Ext functors.
متن کاملThe ring of k-regular sequences, II
In this paper we continue our study of k regular sequences begun in We prove some new results give many new examples from the literature and state some open problems
متن کاملA Final Coalgebra for k-regular Sequences
We study k-regular sequences from a coalgebraic perspective. Building on the observation that the set of streams over a semiring S can be turned into a final coalgebra, we obtain characterizations of kregular sequences in terms of finite weighted automata, finite systems of behavioral differential equations, and recognizable power series. The latter characterization is obtained via an isomorphi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2022
ISSN: ['1879-2294', '0304-3975']
DOI: https://doi.org/10.1016/j.tcs.2022.01.018