Factorisable monoid of generalized hypersubstitutions of type<inf>T</inf> = (n)
© 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....
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Journal |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84955266615&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/55961 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| id |
th-cmuir.6653943832-55961 |
|---|---|
| record_format |
dspace |
| spelling |
th-cmuir.6653943832-559612018-09-05T03:06:37Z Factorisable monoid of generalized hypersubstitutions of type<inf>T</inf> = (n) A. Boonmee S. Leeratanavalee Mathematics © 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. 2018-09-05T03:06:37Z 2018-09-05T03:06:37Z 2016-01-01 Journal 13360310 08629544 2-s2.0-84955266615 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84955266615&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/55961 |
| institution |
Chiang Mai University |
| building |
Chiang Mai University Library |
| country |
Thailand |
| collection |
CMU Intellectual Repository |
| topic |
Mathematics |
| spellingShingle |
Mathematics A. Boonmee S. Leeratanavalee Factorisable monoid of generalized hypersubstitutions of type<inf>T</inf> = (n) |
| description |
© 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. |
| format |
Journal |
| author |
A. Boonmee S. Leeratanavalee |
| author_facet |
A. Boonmee S. Leeratanavalee |
| author_sort |
A. Boonmee |
| title |
Factorisable monoid of generalized hypersubstitutions of type<inf>T</inf> = (n) |
| title_short |
Factorisable monoid of generalized hypersubstitutions of type<inf>T</inf> = (n) |
| title_full |
Factorisable monoid of generalized hypersubstitutions of type<inf>T</inf> = (n) |
| title_fullStr |
Factorisable monoid of generalized hypersubstitutions of type<inf>T</inf> = (n) |
| title_full_unstemmed |
Factorisable monoid of generalized hypersubstitutions of type<inf>T</inf> = (n) |
| title_sort |
factorisable monoid of generalized hypersubstitutions of type<inf>t</inf> = (n) |
| publishDate |
2018 |
| url |
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84955266615&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/55961 |
| _version_ |
1681424602997194752 |