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 |
