19 research outputs found
About the p-paperfolding words
AbstractLet p be an integer greater than or equal to 2. The aim of this paper is to study the language associated to a p-paperfolding sequence. It is known that the number of factors of length n of a 2-paperfolding sequence (i.e. its complexity function) is P(n) = 4n for n ⩾ 7. It is also known that the language of all the factors of all 2-paperfolding sequences is not context-free and that its generating function is transcendental.We show that the complexity function of a p-paperfolding sequence is either strictly subaffine or ultimately linear. The first case never happens if p = 2 or 3. In the second case, the complexity function is either P(n) = 2n or P(n) = 4n for n large enough. We give a simple necessary and sufficient condition for the number of special factors to be p-automatic. We finally show that, for any given p, the language of all factors of all p-paperfolding sequences is not context-free, and that the associated generating series is not algebraic
On prefix palindromic length of automatic words
The prefix palindromic length of an infinite
word is the minimal number of concatenated palindromes needed to
express the prefix of length of . Since 2013, it is still
unknown if is unbounded for every aperiodic
infinite word , even though this has been proven for almost all
aperiodic words. At the same time, the only well-known nontrivial infinite word
for which the function has been precisely
computed is the Thue-Morse word . This word is -automatic and,
predictably, its function is -regular, but is
this the case for all automatic words?
In this paper, we prove that this function is -regular for every
-automatic word containing only a finite number of palindromes. For two such
words, namely the paperfolding word and the Rudin-Shapiro word, we derive a
formula for this function. Our computational experiments suggest that generally
this is not true: for the period-doubling word, the prefix palindromic length
does not look -regular, and for the Fibonacci word, it does not look
Fibonacci-regular. If proven, these results would give rare (if not first)
examples of a natural function of an automatic word which is not regular.Comment: revised version, to appear in Theoret. Comput. Sc
(Logarithmic) densities for automatic sequences along primes and squares
In this paper we develop a method to transfer density results for primitive
automatic sequences to logarithmic-density results for general automatic
sequences. As an application we show that the logarithmic densities of any
automatic sequence along squares and primes
exist and are computable. Furthermore, we give for these subsequences a
criterion to decide whether the densities exist, in which case they are also
computable.
In particular in the prime case these densities are all rational. We also
deduce from a recent result of the third author and Lema\'nczyk that all
subshifts generated by automatic sequences are orthogonal to any bounded
multiplicative aperiodic function.Comment: 38 page
Overlap-Free Words and Generalizations
The study of combinatorics on words dates back at least to the beginning of the 20th century and the work of Axel Thue. Thue was the first to give an example of an infinite word over a three letter alphabet that contains no squares (identical adjacent blocks) xx. This result was eventually used to solve some longstanding open problems in algebra and has remarkable connections to other areas of mathematics and computer science as well.
This thesis will consider several different generalizations of Thue's work. In particular we shall study the properties of infinite words avoiding various types of repetitions.
In Chapter 1 we introduce the theory of combinatorics on words. We present the basic definitions and give an historical survey of the area.
In Chapter 2 we consider the work of Thue in more detail. We present various well-known properties of the Thue-Morse word and give some generalizations. We examine Fife's characterization of the infinite overlap-free words and give a simpler proof of this result. We also present some applications to transcendental number theory, generalizing a classical result of Mahler.
In Chapter 3 we generalize a result of Seebold by showing that the only infinite 7/3-power-free binary words that can be obtained by iterating a morphism are the Thue-Morse word and its complement.
In Chapter 4 we continue our study of overlap-free and 7/3-power-free words. We discuss the squares that can appear as subwords of these words. We also show that it is possible to construct infinite 7/3-power-free binary words containing infinitely many overlaps.
In Chapter 5 we consider certain questions of language theory. In particular, we examine the context-freeness of the set of words containing overlaps. We show that over a three-letter alphabet, this set is not context-free, and over a two-letter alphabet, we show that this set cannot be unambiguously context-free.
In Chapter 6 we construct infinite words over a four-letter alphabet that avoid squares in any arithmetic progression of odd difference. Our constructions are based on properties of the paperfolding words. We use these infinite words to construct non-repetitive tilings of the integer lattice.
In Chapter 7 we consider approximate squares rather than squares. We give constructions of infinite words that avoid such approximate squares.
In Chapter 8 we conclude the work and present some open problems
Numeration systems: a bridge between formal languages and number theory
Considering an integer base b, any integer is represented by a word over a finite digit-set, its base-b expansion. In theoretical computer science, one is interested in syntactical properties of words or languages, i.e., sets of words. In this introductory talk, I will present recognizable sets of numbers : the set of their representations is accepted by a finite automaton. We will see that this property strongly depends on the choice of the numeration system. We will therefore review some fundamental questions and introduce automatic sequences. Thanks to Büchi-Bruyère theorem, first order logic and decidable theories may be used to produce automatic proofs and in particular solve, in an automated way, arithmetical problems. I will not assume any knowledge from the audience about formal languages theory
Deciding Properties of Automatic Sequences
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