12 research outputs found

    The Critical Exponent is Computable for Automatic Sequences

    Full text link
    The critical exponent of an infinite word is defined to be the supremum of the exponent of each of its factors. For k-automatic sequences, we show that this critical exponent is always either a rational number or infinite, and its value is computable. Our results also apply to variants of the critical exponent, such as the initial critical exponent of Berthe, Holton, and Zamboni and the Diophantine exponent of Adamczewski and Bugeaud. Our work generalizes or recovers previous results of Krieger and others, and is applicable to other situations; e.g., the computation of the optimal recurrence constant for a linearly recurrent k-automatic sequence.Comment: In Proceedings WORDS 2011, arXiv:1108.341

    Automatic sets of rational numbers

    Full text link
    The notion of a k-automatic set of integers is well-studied. We develop a new notion - the k-automatic set of rational numbers - and prove basic properties of these sets, including closure properties and decidability.Comment: Previous version appeared in Proc. LATA 2012 conferenc

    Enumeration and Decidable Properties of Automatic Sequences

    Full text link
    We show that various aspects of k-automatic sequences -- such as having an unbordered factor of length n -- are both decidable and effectively enumerable. As a consequence it follows that many related sequences are either k-automatic or k-regular. These include many sequences previously studied in the literature, such as the recurrence function, the appearance function, and the repetitivity index. We also give some new characterizations of the class of k-regular sequences. Many results extend to other sequences defined in terms of Pisot numeration systems

    The upper density of an automatic set is rational

    Get PDF
    Given a natural number k2k\ge 2 and a kk-automatic set SS of natural numbers, we show that the lower density and upper density of SS are recursively computable rational numbers and we provide an algorithm for computing these quantities. In addition, we show that for every natural number k2k\ge 2 and every pair of rational numbers (α,β)(\alpha,\beta) with 0<α<β<10<\alpha<\beta<1 or with (α,β){(0,0),(1,1)}(\alpha,\beta)\in \{(0,0),(1,1)\} there is a kk-automatic subset of the natural numbers whose lower density and upper density are α\alpha and β\beta respectively, and we show that these are precisely the values that can occur as the lower and upper densities of an automatic set.Comment: 16 pages. This version corrects the proof of Lemma 3.1 in addition to making other change

    Deciding Properties of Automatic Sequences

    Get PDF
    In this thesis, we show that several natural questions about automatic sequences can be expressed as logical predicates and then decided mechanically. We extend known results in this area to broader classes of sequences (e.g., paperfolding words), introduce new operations that extend the space of possible queries, and show how to process the results. We begin with the fundamental concepts and problems related to automatic sequences, and the corresponding numeration systems. Building on that foundation, we discuss the general logical framework that formalizes the questions we can mechanically answer. We start with a first-order logical theory, and then extend it with additional predicates and operations. Then we explain a slightly different technique that works on a monadic second- order theory, but show that it is ultimately subsumed by an extension of the first-order theory. Next, we give two applications: critical exponent and paperfolding words. In the critical exponent example, we mechanically construct an automaton that describes a set of rational numbers related to a given automatic sequence. Then we give a polynomial-time algorithm to compute the supremum of this rational set, allowing us to compute the critical exponent and many similar quantities. In the paperfolding example, we extend our mechanical procedure to the paperfolding words, an uncountably infinite collection of infinite words. In the following chapter, we address abelian and additive problems on automatic sequences. We give an example of a natural predicate which is provably inexpressible in our first-order theory, and discuss alternate methods for solving abelian and additive problems on automatic sequences. We close with a chapter of open problems, drawn from the earlier chapters
    corecore