View in EDS PDF Full Text

Parikh Matrices and Parikh Rewriting Systems.

Saved in:
Bibliographic Details
Title: Parikh Matrices and Parikh Rewriting Systems.
Authors: Teh, Wen Chean1 dasmenteh@usm.my
Source: Fundamenta Informaticae. 2016, Vol. 146 Issue 3, p305-320. 16p.
Subjects: Rewriting systems (Computer science), Injective functions, Complex multiplication, Monoids
Abstract: Since the introduction of the Parikh matrix mapping, its injectivity problem is on top of the list of open problems in this topic. In 2010 Salomaa provided a solution for the ternary alphabet in terms of a Thue system with an additional feature called counter. This paper proposes the notion of a Parikh rewriting system as a generalization and systematization of Salomaa's result. It will be shown that every Parikh rewriting system induces a Thue system without counters that serves as a feasible solution to the injectivity problem. [ABSTRACT FROM AUTHOR]
Copyright of Fundamenta Informaticae is the property of Polskie Towarzystwo Matematyczne 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 Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 129168888
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Parikh Matrices and Parikh Rewriting Systems.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Teh%2C+Wen+Chean%22">Teh, Wen Chean</searchLink><relatesTo>1</relatesTo><i> dasmenteh@usm.my</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Fundamenta+Informaticae%22">Fundamenta Informaticae</searchLink>. 2016, Vol. 146 Issue 3, p305-320. 16p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Rewriting+systems+%28Computer+science%29%22">Rewriting systems (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Injective+functions%22">Injective functions</searchLink><br /><searchLink fieldCode="DE" term="%22Complex+multiplication%22">Complex multiplication</searchLink><br /><searchLink fieldCode="DE" term="%22Monoids%22">Monoids</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Since the introduction of the Parikh matrix mapping, its injectivity problem is on top of the list of open problems in this topic. In 2010 Salomaa provided a solution for the ternary alphabet in terms of a Thue system with an additional feature called counter. This paper proposes the notion of a Parikh rewriting system as a generalization and systematization of Salomaa's result. It will be shown that every Parikh rewriting system induces a Thue system without counters that serves as a feasible solution to the injectivity problem. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Fundamenta Informaticae is the property of Polskie Towarzystwo Matematyczne 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=129168888
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.3233/FI-2016-1388
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 16
        StartPage: 305
    Subjects:
      – SubjectFull: Rewriting systems (Computer science)
        Type: general
      – SubjectFull: Injective functions
        Type: general
      – SubjectFull: Complex multiplication
        Type: general
      – SubjectFull: Monoids
        Type: general
    Titles:
      – TitleFull: Parikh Matrices and Parikh Rewriting Systems.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Teh, Wen Chean
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 15
              M: 06
              Text: 2016
              Type: published
              Y: 2016
          Identifiers:
            – Type: issn-print
              Value: 01692968
          Numbering:
            – Type: volume
              Value: 146
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: Fundamenta Informaticae
              Type: main
ResultId 1