59 research outputs found
Circular critical exponents for Thue-Morse factors
We prove various results about the largest exponent of a repetition in a
factor of the Thue-Morse word, when that factor is considered as a circular
word. Our results confirm and generalize previous results of Fitzpatrick and
Aberkane & Currie
Subword complexity and power avoidance
We begin a systematic study of the relations between subword complexity of
infinite words and their power avoidance. Among other things, we show that
-- the Thue-Morse word has the minimum possible subword complexity over all
overlap-free binary words and all -power-free binary words, but not
over all -power-free binary words;
-- the twisted Thue-Morse word has the maximum possible subword complexity
over all overlap-free binary words, but no word has the maximum subword
complexity over all -power-free binary words;
-- if some word attains the minimum possible subword complexity over all
square-free ternary words, then one such word is the ternary Thue word;
-- the recently constructed 1-2-bonacci word has the minimum possible subword
complexity over all \textit{symmetric} square-free ternary words.Comment: 29 pages. Submitted to TC
Periodicity, repetitions, and orbits of an automatic sequence
We revisit a technique of S. Lehr on automata and use it to prove old and new
results in a simple way. We give a very simple proof of the 1986 theorem of
Honkala that it is decidable whether a given k-automatic sequence is ultimately
periodic. We prove that it is decidable whether a given k-automatic sequence is
overlap-free (or squareefree, or cubefree, etc.) We prove that the
lexicographically least sequence in the orbit closure of a k-automatic sequence
is k-automatic, and use this last result to show that several related
quantities, such as the critical exponent, irrationality measure, and
recurrence quotient for Sturmian words with slope alpha, have automatic
continued fraction expansions if alpha does.Comment: preliminary versio
Bispecial factors in circular non-pushy D0L languages
We study bispecial factors in fixed points of morphisms. In particular, we
propose a simple method of how to find all bispecial words of non-pushy
circular D0L-systems. This method can be formulated as an algorithm. Moreover,
we prove that non-pushy circular D0L-systems are exactly those with finite
critical exponent.Comment: 18 pages, 5 figure
Avoiding letter patterns in ternary square-free words
We consider special patterns of lengths 5 and 6 in a ternary alphabet. We show that some of them are unavoidable in square-free words and prove avoidability of the other ones. Proving the main results, we use Fibonacci words as codes of ternary words in some natural coding system and show that they can be decoded to square- free words avoiding the required patterns. Furthermore, we estimate the minimal local (critical) exponents of square-free words with such avoidance properties. © 2016, Australian National University. All rights reserved
Enumeration and Decidable Properties of Automatic Sequences
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
- …