Extremal Words in the Shift Orbit Closure of a Morphic Sequence

نویسندگان

  • James D. Currie
  • Narad Rampersad
  • Kalle Saari
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extremal words in morphic subshifts

Given an infinite word x over an alphabet A, a letter b occurring in x, and a total order σ on A, we call the smallest word with respect to σ starting with b in the shift orbit closure of x an extremal word of x. In this paper we consider the extremal words of morphic words. If x = g(fω(a)) for some morphisms f and g, we give two simple conditions on f and g that guarantees that all extremal wo...

متن کامل

Suffix Conjugates for a Class of Morphic Subshifts - (Extended Abstract)

Let A be a finite alphabet and f : A → A be a morphism with an iterative fixed point f(α), where α ∈ A. Consider the subshift (X , T ), where X is the shift orbit closure of f(α) and T : X → X is the shift map. Let S be a finite alphabet that is in bijective correspondence via a mapping c with the set of nonempty suffixes of the images f(a) for a ∈ A. Let S ⊂ S be the set of infinite words s = ...

متن کامل

Infinite self-shuffling words

In this paper we introduce and study a new property of infinite words: An infinite word x ∈ A, with values in a finite set A, is said to be k-self-shuffling (k ≥ 2) if x admits factorizations: x = ∏∞ i=0 U (1) i · · ·U (k) i = ∏∞ i=0 U (1) i = · · · = ∏∞ i=0 U (k) i . In other words, there exists a shuffle of k-copies of x which produces x. We are particularly interested in the case k = 2, in w...

متن کامل

Pseudopalindrome closure operators in free monoids

We consider involutory antimorphisms θ of a free monoid A∗ and their fixed points, called θ-palindromes or pseudopalindromes. A θ-palindrome reduces to a usual palindrome when θ is the reversal operator. For any word w ∈ A∗ the right (resp. left) θ-palindrome closure of w is the shortest θ-palindrome having w as a prefix (resp. suffix). We prove some results relating θ-palindrome closure operat...

متن کامل

A Hierarchy of Automatic Words having a Decidable MSO Theory

We investigate automatic presentations of infinite words. Starting points of our study are the works of Rigo and Maes, and Carton and Thomas concerning the lexicographic presentation, respectively the decidability of the MSO theory of morphic words. Refining their techniques we observe that the lexicographic presentation of a (morphic) word is canonical in a certain sense. We then go on to gene...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013