Bibliographic Details
| Title: |
BINARY AMIABLE WORDS. |
| Authors: |
Atanasiu, Adrian1 aadrian@gmail.com |
| Source: |
International Journal of Foundations of Computer Science. Apr2007, Vol. 18 Issue 2, p387-400. 14p. 3 Diagrams, 3 Charts. |
| Subjects: |
Alphabet -- Data processing, Vocabulary, Matrices (Mathematics), Binary control systems, Graphic methods, Universal algebra |
| 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. [ABSTRACT FROM AUTHOR] |
|
Copyright of International Journal of Foundations of Computer Science is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
