Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/55961Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | A. Boonmee | en_US |
| dc.contributor.author | S. Leeratanavalee | en_US |
| dc.date.accessioned | 2018-09-05T03:06:37Z | - |
| dc.date.available | 2018-09-05T03:06:37Z | - |
| dc.date.issued | 2016-01-01 | en_US |
| dc.identifier.issn | 13360310 | en_US |
| dc.identifier.issn | 08629544 | en_US |
| dc.identifier.other | 2-s2.0-84955266615 | en_US |
| dc.identifier.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84955266615&origin=inward | en_US |
| dc.identifier.uri | http://cmuir.cmu.ac.th/jspui/handle/6653943832/55961 | - |
| dc.description.abstract | © 2016, Univerzita Komenskeho. All rights reserved. A generalized hypersubstitution of type T maps any operation symbols to the set of all terms. The extensions of generalized hypersubstitutions are map-pings on the set of all terms. The set of all such generalized hypersubstitutions forms a monoid. In this paper, we determine the set of all unit-regular elements of this monoid of typeT = (n). We also conclude a submonoid of the monoid of all generalized hypersubstitutions of type T = (n) which is factorisable. | en_US |
| dc.subject | Mathematics | en_US |
| dc.title | Factorisable monoid of generalized hypersubstitutions of type<inf>T</inf> = (n) | en_US |
| dc.type | Journal | en_US |
| article.title.sourcetitle | Acta Mathematica Universitatis Comenianae | en_US |
| article.volume | 85 | en_US |
| article.stream.affiliations | Chiang Mai University | en_US |
| Appears in Collections: | CMUL: Journal Articles | |
Files in This Item:
There are no files associated with this item.
Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.