Binary amiable words

Using the fact that the Parikh matrix mapping is not an injective mapping, the paper investigates some properties of the set of the binary words having the same Parikh matrix; these words are called “amiable” Some results concerning the conditions when the equivalence classes of amiable words have more than one element, a characterization theorem concerning a graph associated to an equivalence class of amiable words, and some basic properties of a rank distance defined on these classes are the main subjects considered here.

Articol

Using the fact that the Parikh matrix mapping is not an injective mapping, the paper investigates some properties of the set of the binary words having the same Parikh matrix; these words are called “amiable” Some results concerning the conditions when the equivalence classes of amiable words have more than one element, a characterization theorem concerning a graph associated to an equivalence class of amiable words, and some basic properties of a rank distance defined on these classes are the main subjects considered here.

Data Publicării (d-m-y): 2010
Editură: Unknown
Locul Publicării: Unknown
Limba: Engleză
Furnizor: BCU 'Carol I' Bucuresti
Drepturi: https://creativecommons.org/publicdomain/mark/1.0

Obiecte Digitale Similare