Please use this identifier to cite or link to this item: http://restitutio.bcub.ro/handle/123456789/437
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAtanasiu, Adrian-
dc.date.accessioned2016-05-30T06:41:42Z-
dc.date.available2016-05-30T06:41:42Z-
dc.date.issued2010-
dc.identifier.urihttp://restitutio.bcub.ro/handle/123456789/437-
dc.description.abstractUsing 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.language.isoen_USen_US
dc.titleBinary amiable wordsen_US
Appears in Collections:Articole ale cadrelor didactice / Articles of the teaching staff

Files in This Item:
File Description SizeFormat 
Binary_amiable_words_p.pdf214.04 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.