Please use this identifier to cite or link to this item:
Full metadata record
|dc.description.abstract||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.||en_US|
|dc.title||Binary amiable words||en_US|
|Appears in Collections:||Articole ale cadrelor didactice / Articles of the teaching staff|
Files in This Item:
|Binary_amiable_words_p.pdf||214.04 kB||Adobe PDF||View/Open|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.