Challenges in Combinatorics on Words April 22 - 26 2013 1 Minimum number of unbordered factors — Kalle
نویسندگان
چکیده
A quasiperiodic word is, here, a finite or infinite word that can be obtained by concatenations or overlaps of a given finite word, called a quasiperiod of the whole word. For instance, aba is a quasiperiod of the Fibonacci word. It is an immediate observation that any quasiperiodic word contains an overlap. Thus its critical exponent is greater than 2. What is the minimal critical exponent of an infinite quasiperiodic word over an alphabet A?
منابع مشابه
Automatic Theorem-Proving in Combinatorics on Words
We describe a technique for mechanically proving certain kinds of theorems in combinatorics on words, using automata and a package for manipulating them. We illustrate our technique by solving, purely mechanically, an open problem of Currie and Saari on the lengths of unbordered factors in the Thue-Morse sequence. Dedicated to the memory of Sheng Yu (1950–2012): friend and colleague
متن کاملBiinfinite words with maximal recurrent unbordered factors
A finite non-empty word z is said to be a border of a finite non-empty word w if w = uz = zv for some non-empty words u and v. A finite non-empty word is said to be bordered if it admits a border, and it is said to be unbordered otherwise. In this paper, we give two characterizations of the biinfinite words of the form uvu, where u and v are finite words, in terms of its unbordered factors. The...
متن کاملUnbordered partial words
An unbordered word is a string over a finite alphabet such that none of its proper prefixes is one of its suffixes. In this paper, we extend the results on unbordered words to unbordered partial words. Partial words are strings that may have a number of ―do not know‖ symbols. We extend a result of Ehrenfeucht and Silberger which states that if a word u can be written as a concatenation of nonem...
متن کاملFully bordered words
Any primitive binary word contains at least two unbordered conjugates. We characterize binary words that have exactly two unbordered conjugates and show that they can be expressed as a product of two palindromes. In this paper we relate two elementary properties of finite words: being a palin-drome and being unbordered. These two concepts are in a sense complementary. Unbordered words have maxi...
متن کاملOn the number of Abelian Bordered Words (with an Example of Automatic Theorem-Proving)
In the literature, many bijections between (labeled) Motzkin paths and various other combinatorial objects are studied. We consider abelian (un)bordered words and show the connection with irreducible symmetric Motzkin paths and paths in Z not returning to the origin. This study can be extended to abelian unbordered words over an arbitrary alphabet and we derive expressions to compute the number...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013