Parikh Matrices, Amiability and Istrail Morphism

نویسنده

  • Adrian Atanasiu
چکیده

Using the fact that the Parikh matrix mapping is not an injective mapping, the paper investigates some properties of the set of words having the same Parikh matrix; these words are called “amiable” or “M equivalent”. The presented paper uses the results obtained in [3] for the binary case. The aim is to distinguish the amiable words by using a morphism that provides additional information about them. The morphism proposed here is the Istrail morphism.

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

ثبت نام

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

منابع مشابه

A Matrix q-Analogue of the Parikh Map

We introduce an extension of the Parikh mapping called the Parikh -matrix mapping, which takes its values in matrices with polynomial entries. The morphism constructed represents a word over a -letter alphabet as a -dimensional upper-triangular matrix with entries that are nonnegative integral polynomials in variable . We show that by appropriately embedding the -letter alphabet into the -lette...

متن کامل

A q-Matrix Encoding Extending the Parikh Matrix Mapping

We introduce a generalization of the Parikh mapping called the Parikh q-matrix encoding, which takes its values in matrices with polynomial entries. The encoding represents a word w over a k-letter alphabet as a (k + 1)-dimensional upper-triangular matrix with entries that are nonnegative integral polynomials in variable q. Putting q = 1, we obtain the morphism introduced by Mateescu, Salomaa, ...

متن کامل

Injectivity of the Parikh Matrix Mappings Revisited

We deal with the notion of M-unambiguity [5] in connection with the Parikh matrix mapping introduced by Mateescu and others in [7]. M-unambiguity is studied both in terms of words and matrices and several sufficient criteria for M-unambiguity are provided in both cases, nontrivially generalizing the criteria based on the γ-property introduced by Salomaa in [15]. Also, the notion of M-unambiguit...

متن کامل

Parikh Matrices and Words over Tertiary Ordered Alphabet

Parikh matrix is a numerical property of a word on an ordered alphabet. It is used for studying word in terms of its sub words. It was introduced by Mateescu et al. in 2000. Since then it has been being studied for various ordered alphabets. In this paper Parikh Matrices over tertiary alphabet are investigated. Algorithm is developed to display Parikh Matrices of words over tertiary alphabet. T...

متن کامل

Extending Parikh q-matrices

1. A. Atanasiu. Binary amiable words. International Journal of Foundations of Computer Science, 18(2):387–400, 2007. 2. A. Atanasiu, R. Atanasiu, and I. Petre. Parikh matrices and amiable words. Theoretical Computer Science, 390:102–109, 2008. 3. A. Atanasiu, C. Martin-Vide, and A. Mateescu. On the injectivity of the parikh matrix mapping. Fundamenta Informatica, 46:1–11, 2001. 4. S. Bera and K...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:
  • Int. J. Found. Comput. Sci.

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2010