منابع مشابه
Recognizability for Sequences of Morphisms
We investigate different notions of recognizability for a free monoid morphism σ : A∗ → B∗. Full recognizability occurs when each (aperiodic) point in BZ admits at most one tiling with words σ(a), a ∈ A. This is stronger than the classical notion of recognizability of a substitution σ : A∗ → A∗, where the tiling must be compatible with the language of the substitution. We show that if |A| = 2, ...
متن کاملThe constant of recognizability is computable for primitive morphisms
Mossé proved that primitive morphisms are recognizable. In this paper we give a computable upper bound for the constant of recognizability of such a morphism. This bound can be expressed only using the cardinality of the alphabet and the length of the longest image under the morphism of a letter.
متن کاملTransforming Sequences using Threaded Morphisms
Sequences are very useful structures in programming languages. Functional programming languages allow the convenient deenition of transformations between sequence algebras and other types of data algebra. Sequence homomorphisms are an important class of such transformations. However, not all desired transformations can be expressed as homomor-phisms. This paper describes a class of transformati...
متن کاملMorphisms, Symbolic sequences, and their Standard Forms
Morphisms are homomorphisms under the concatenation operation of the set of words over a finite set. Changing the elements of the finite set does not essentially change the morphism. We propose a way to select a unique representing member out of all these morphisms. This has applications to the classification of the shift dynamical systems generated by morphisms. In a similar way, we propose th...
متن کاملPalindromic sequences generated from marked morphisms
Fixed points u = φ(u) of marked and primitive morphisms φ over arbitrary alphabet are considered. We show that if u is palindromic, i.e., its language contains infinitely many palindromes, then some power of φ has a conjugate in class P. This class was introduced by Hof, Knill and Simon (1995) in order to study palindromic morphic words. Our definitions of marked and well-marked morphisms are m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ergodic Theory and Dynamical Systems
سال: 2018
ISSN: 0143-3857,1469-4417
DOI: 10.1017/etds.2017.144