Results 1  10
of
36
Logic and precognizable sets of integers
 Bull. Belg. Math. Soc
, 1994
"... We survey the properties of sets of integers recognizable by automata when they are written in pary expansions. We focus on Cobham’s theorem which characterizes the sets recognizable in different bases p and on its generalization to N m due to Semenov. We detail the remarkable proof recently given ..."
Abstract

Cited by 68 (4 self)
 Add to MetaCart
We survey the properties of sets of integers recognizable by automata when they are written in pary expansions. We focus on Cobham’s theorem which characterizes the sets recognizable in different bases p and on its generalization to N m due to Semenov. We detail the remarkable proof recently given by Muchnik for the theorem of CobhamSemenov, the original proof being published in Russian. 1
Numeration systems, linear recurrences, and regular sets
 Inform. and Comput
, 1994
"... A numeration system based on a strictly increasing sequence of positive integers u0 = 1, u1, u2,... expresses a nonnegative integer n as a sum n = � i j=0 ajuj. In this case we say the string aiai−1 · · · a1a0 is a representation for n. If gcd(u0, u1,...) = g, then every sufficiently large mult ..."
Abstract

Cited by 36 (4 self)
 Add to MetaCart
A numeration system based on a strictly increasing sequence of positive integers u0 = 1, u1, u2,... expresses a nonnegative integer n as a sum n = � i j=0 ajuj. In this case we say the string aiai−1 · · · a1a0 is a representation for n. If gcd(u0, u1,...) = g, then every sufficiently large multiple of g has some representation. If the lexicographic ordering on the representations is the same as the usual ordering of the integers, we say the numeration system is orderpreserving. In particular, if u0 = 1, then the greedy representation, obtained via the greedy algorithm, is orderpreserving. We prove that, subject to some technical assumptions, if the set of all representations in an orderpreserving numeration system is regular, then the sequence u = (uj)j≥0 satisfies a linear recurrence. The converse, however, is not true. The proof uses two lemmas about regular sets that may be of independent interest. The first shows that if L is regular, then the set of lexicographically greatest strings of every length in L is also regular. The second shows that the number of strings of length n in a regular language L is bounded by a constant (independent of n) iff L is the finite union of sets of the form xy ∗ z. 1
Ergodic properties of Erdős measure, the entropy of the goldenshift and related problems
 MATH
, 1998
"... We define a twosided analog of Erdös measure on the space of twosided expansions with respect to the powers of the golden ratio, or, equivalently, the Erdös measure on the 2torus. We construct the transformation (goldenshift) preserving both Erdös and Lebesgue measures on T² which is the induced ..."
Abstract

Cited by 32 (17 self)
 Add to MetaCart
We define a twosided analog of Erdös measure on the space of twosided expansions with respect to the powers of the golden ratio, or, equivalently, the Erdös measure on the 2torus. We construct the transformation (goldenshift) preserving both Erdös and Lebesgue measures on T² which is the induced automorphism with respect to the ordinary shift (or the corresponding Fibonacci toral automorphism) and proves to be Bernoulli with respect to both measures in question. This provides a direct way to obtain formulas for the entropy dimension of the Erdős measure on the interval, its entropy in the sense of GarsiaAlexanderZagier and some other results. Besides, we study central measures on the Fibonacci graph, the dynamics of expansions and related questions.
Random Series In Powers Of Algebraic Integers: Hausdorff Dimension Of The Limit Distribution
, 1995
"... We study the distributions F`;p of the random sums P 1 1 " n` n , where " 1 ; " 2 ; : : : are i.i.d. Bernoullip and ` is the inverse of a Pisot number (an algebraic integer fi whose conjugates all have moduli less than 1) between 1 and 2. It is known that, when p = :5, F`;p is a singular m ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
We study the distributions F`;p of the random sums P 1 1 " n` n , where " 1 ; " 2 ; : : : are i.i.d. Bernoullip and ` is the inverse of a Pisot number (an algebraic integer fi whose conjugates all have moduli less than 1) between 1 and 2. It is known that, when p = :5, F`;p is a singular measure with exact Hausdorff dimension less than 1. We show that in all cases the Hausdorff dimension can be expressed as the top Lyapunov exponent of a sequence of random matrices, and provide an algorithm for the construction of these matrices. We show that for certain fi of small degree, simulation gives the Hausdorff dimension to several decimal places.
Numeration systems on a regular language
 Theory Comput. Syst
"... Generalizations of linear numeration systems in which IN is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of numeration, we show that ultimately periodic sets are recognizable. We also study t ..."
Abstract

Cited by 14 (7 self)
 Add to MetaCart
Generalizations of linear numeration systems in which IN is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of numeration, we show that ultimately periodic sets are recognizable. We also study the translation and the multiplication by constants as well as the orderdependence of the recognizability. 1
On the Automata Size for Presburger Arithmetic
 In Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS 2004
, 2004
"... Automata provide an effective mechanization of decision procedures for Presburger arithmetic. However, only crude lower and upper bounds are known on the sizes of the automata produced by this approach. In this paper, we prove that the number of states of the minimal deterministic automaton for a Pr ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
Automata provide an effective mechanization of decision procedures for Presburger arithmetic. However, only crude lower and upper bounds are known on the sizes of the automata produced by this approach. In this paper, we prove that the number of states of the minimal deterministic automaton for a Presburger arithmetic formula is triple exponentially bounded in the length of the formula. This upper bound is established by comparing the automata for Presburger arithmetic formulas with the formulas produced by a quantifier elimination method. We also show that this triple exponential bound is tight (even for nondeterministic automata). Moreover, we provide optimal automata constructions for linear equations and inequations.
Automatic conversion from Fibonacci representation to representation in base qhi, and a generalization
, 1998
"... Every positive integer can be written as a sum of Fibonacci numbers; it can also be written as a (finite) sum of (positive and negative) powers of the golden mean '. We show that there exists a lettertoletter finite twotape automaton that maps the Fibonacci representation of any positive integer ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
Every positive integer can be written as a sum of Fibonacci numbers; it can also be written as a (finite) sum of (positive and negative) powers of the golden mean '. We show that there exists a lettertoletter finite twotape automaton that maps the Fibonacci representation of any positive integer onto its 'expansion, provided the latter is folded around the radix point. As a corollary, the set of 'expansions of the positive integers is a linear contextfree language. These results are actually proved in the more general case of quadratic Pisot units. R'esum'e Tout nombre entier positif peut s"ecrire comme une somme de nombres de Fibonacci; tout entier peut 'egalement s"ecrire comme une somme (finie) de puissances (positives et n'egatives) du "nombre d'or" '. Nous montrons qu'il existe un automate `a deux bandes, fini et lettre`alettre, qui envoie la repr'esentation d'un entier en base de Fibonacci sur sa repr'esentation dans la base ' modulo le fait qu'on a repli'e cette derni`e...
OnLine Finite Automata for Addition in Some Numeration Systems
"... We consider numeration systems where the base is a negative integer, or a complex number which is a root of a negative integer. We give parallel algorithms for addition in these numeration systems, from which we derive online algorithms realized by finite automata. A general construction relatin ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
We consider numeration systems where the base is a negative integer, or a complex number which is a root of a negative integer. We give parallel algorithms for addition in these numeration systems, from which we derive online algorithms realized by finite automata. A general construction relating addition in base fi and addition in base fi m is given. Results on addition in base fi = m p b, where b is a relative integer, follow. We also show that addition in base the golden ratio is computable by an online finite automaton, but is not parallelizable. 1 Introduction A positional numeration system is given by a base and by a set of digits. In the most usual numeration systems, the base is an integer b 2 and the digit set is f0; : : : ; b \Gamma 1g. In order to represent complex numbers without separating the real and the imaginary part, one can use a complex base. For instance, it is known that every complex number can be expressed with base i p 2 and digit set f0; 1g (...