On iterating linear transformations over recognizable sets of integers
نویسندگان
چکیده
منابع مشابه
On iterating linear transformations over recognizable sets of integers
It has been known for a long time that the sets of integer vectors that are recognizable by finite-state automata are those that can be defined in an extension of Presburger arithmetic. In this paper, we address the problem of deciding whether the closure of a linear transformation preserves the recognizable nature of sets of integer vectors. We solve this problem by introducing an original ext...
متن کاملLOGIC AND p-RECOGNIZABLE SETS OF INTEGERS
We survey the properties of sets of integers recognizable by automata when they are written in p-ary expansions. We focus on Cobham’s theorem which characterizes the sets recognizable in different bases p and on its generalization to Nm due to Semenov. We detail the remarkable proof recently given by Muchnik for the theorem of Cobham-Semenov, the original proof being published in Russian.
متن کاملInverse Problems for Linear Forms over Finite Sets of Integers
Let f(x1, x2, . . . , xm) = u1x1 + u2x2 + · · · + umxm be a linear form with positive integer coefficients, and let Nf (k) = min{|f(A)| : A ⊆ Z and |A| = k}. A minimizing k-set for f is a set A such that |A| = k and |f(A)| = Nf (k). A finite sequence (u1, u2, . . . , um) of positive integers is called complete if n
متن کاملBinary Linear Forms over Finite Sets of Integers
Let A be a finite set of integers. For a polynomial f(x1, . . . , xn) with integer coefficients, let f(A) = {f(a1, . . . , an) : a1, . . . , an ∈ A}. In this paper it is proved that for every pair of normalized binary linear forms f(x, y) = u1x + v1y and g(x, y) = u2x + v2y with integral coefficients, there exist arbitrarily large finite sets of integers A and B such that |f(A)| > |g(A)| and |f...
متن کاملOn Equations over Sets of Integers
Systems of equations with sets of integers as unknowns are considered. It isshown that the class of sets representable by unique solutions of equations using the oper-ations of union and addition S + T = {m+ n |m ∈ S, n ∈ T} and with ultimately periodicconstants is exactly the class of hyper-arithmetical sets. Equations using addition only canrepresent every hyper-arithmetical s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(03)00314-1