Conjugacy on partial words

نویسندگان

Francine Blanchet-Sadri

D. K. Luhmann

چکیده

The study of the combinatorial properties of strings of symbols from a finite alphabet (also referred to as words) is profoundly connected to numerous fields such as biology, computer science, mathematics, and physics. In this paper, we examine to which extent some fundamental combinatorial properties of words, such as conjugacy, remain true for partial words. The motivation behind the notion of a partial word is the comparison of two genes (alignment of two such strings can be viewed as a construction of two partial words that are said to be compatible). This study on partial words was initiated by Berstel and Boasson. Article:

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

ثبت نام

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

منابع مشابه

Compatibility and Conjugacy on Partial Arrays

Research in combinatorics on words goes back a century. Berstel and Boasson introduced the partial words in the context of gene comparison. Alignment of two genes can be viewed as a construction of two partial words that are said to be compatible. In this paper, we examine to which extent the fundamental properties of partial words such as compatbility and conjugacy remain true for partial arra...

متن کامل

On Exchange-Robust and Subst-Robust Primitive Partial Words

A partial word is a word that may have some unknown places known as “holes” and can be replaced by the symbols from the underlying alphabet. A partial word u is said to be primitive if there does not exist a word v such that u is contained in a nontrivial integer power of v. We study the preservation of primitivity in partial words by the effect of some point mutation operations. In this paper,...

متن کامل

Equations on Partial Words

It is well known that some of the most basic properties of words, like the commutativity (xy = yx) and the conjugacy (xz = zy), can be expressed as solutions of word equations. An important problem is to decide whether or not a given equation on words has a solution. For instance, the equation xmyn = zp has only periodic solutions in a free monoid, that is, if xmyn = zp holds with integers m,n,...

متن کامل

New Simple Reference State Model of the Third-Order Piecewise-Linear Dynamical Systems

Starting from the first elementary canonical state model, the new simple state model of the thirdorder dynamical systems that belong to Class C is derived. A typical property of this new model is a very simple form of its partial transformation matrix in the conditions of linear topological conjugacy, which represents the unity matrix. Complete state equations and the corresponding integrator-b...

متن کامل