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: |
2017
|
| Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84955266615&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/42370 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| Summary: | © 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. |
|---|