View in EDS

BINARY AMIABLE WORDS.

Saved in:
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
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 24635470
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: BINARY AMIABLE WORDS.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Atanasiu%2C+Adrian%22">Atanasiu, Adrian</searchLink><relatesTo>1</relatesTo><i> aadrian@gmail.com</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Foundations+of+Computer+Science%22">International Journal of Foundations of Computer Science</searchLink>. Apr2007, Vol. 18 Issue 2, p387-400. 14p. 3 Diagrams, 3 Charts.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Alphabet+--+Data+processing%22">Alphabet -- Data processing</searchLink><br /><searchLink fieldCode="DE" term="%22Vocabulary%22">Vocabulary</searchLink><br /><searchLink fieldCode="DE" term="%22Matrices+%28Mathematics%29%22">Matrices (Mathematics)</searchLink><br /><searchLink fieldCode="DE" term="%22Binary+control+systems%22">Binary control systems</searchLink><br /><searchLink fieldCode="DE" term="%22Graphic+methods%22">Graphic methods</searchLink><br /><searchLink fieldCode="DE" term="%22Universal+algebra%22">Universal algebra</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=24635470
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1142/S0129054107004735
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 14
        StartPage: 387
    Subjects:
      – SubjectFull: Alphabet -- Data processing
        Type: general
      – SubjectFull: Vocabulary
        Type: general
      – SubjectFull: Matrices (Mathematics)
        Type: general
      – SubjectFull: Binary control systems
        Type: general
      – SubjectFull: Graphic methods
        Type: general
      – SubjectFull: Universal algebra
        Type: general
    Titles:
      – TitleFull: BINARY AMIABLE WORDS.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Atanasiu, Adrian
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 04
              Text: Apr2007
              Type: published
              Y: 2007
          Identifiers:
            – Type: issn-print
              Value: 01290541
          Numbering:
            – Type: volume
              Value: 18
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: International Journal of Foundations of Computer Science
              Type: main
ResultId 1