UNAMBIGUOUS MORPHIC IMAGES OF STRINGS

نویسندگان
چکیده

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

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

منابع مشابه

On a Family of Morphic Images of Arnoux-Rauzy Words

In this paper we prove the following result. Let s be an infinite word on a finite alphabet, and N ≥ 0 be an integer. Suppose that all left special factors of s longer than N are prefixes of s, and that s has at most one right special factor of each length greater than N . Then s is a morphic image, under an injective morphism, of a suitable standard Arnoux-Rauzy word.

متن کامل

Almost Rich Words as Morphic Images of Rich Words

We focus on Θ-rich and almost Θ-rich words over a finite alphabet A, where Θ is an involutive antimorphism over A∗. We show that any recurrent almost Θ-rich word u is an image of a recurrent Θ′-rich word under a suitable morphism, where Θ′ is also an involutive antimorphism. Moreover, if the word u is uniformly recurrent, we show that Θ′ can be set to the reversal mapping. We also treat one spe...

متن کامل

Unambiguous Photometric Stereo Using Two Images

In the last years, the 3D reconstruction of surfaces which represent objects photographed by simple digital cameras has become more and more necessary to the scientific community. Through the most various mathematical and engineering methods, scientists continue to study the Shape-from-shading problem, using the photometric stereo technique which allows the use of several light sources, but kee...

متن کامل

Morphic Computing

In this paper, we introduce a new type of computation called “Morphic Computing”. Morphic Computing is based on Field Theory and more specifically Morphic Fields. Morphic Fields were first introduced by Rupert Sheldrake [1981] from his hypothesis of formative causation that made use of the older notion of Morphogenetic Fields. Rupert Sheldrake [1981] developed his famous theory, Morphic Resonan...

متن کامل

Morphic Computing: Morphic Systems and Morphic System of Systems (m-sos)

Morphic Computing is based on Field Theory [14-16] and more specifically Morphic Fields. Morphic Fields were first introduced by [18] from his hypothesis of formative causation that made use of the older notion of Morphogenetic Fields. [18] developed his famous theory, Morphic Resonance, on the basis of the work by French philosopher Henri Bergson. Morphic Computingis based on Field Theory and ...

متن کامل

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


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

ژورنال

عنوان ژورنال: International Journal of Foundations of Computer Science

سال: 2006

ISSN: 0129-0541,1793-6373

DOI: 10.1142/s0129054106004017