Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/72774
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Pornpimol Kunama | en_US |
dc.contributor.author | Sorasak Leeratanavalee | en_US |
dc.date.accessioned | 2022-05-27T08:29:29Z | - |
dc.date.available | 2022-05-27T08:29:29Z | - |
dc.date.issued | 2022-01-01 | en_US |
dc.identifier.issn | 18140432 | en_US |
dc.identifier.issn | 18140424 | en_US |
dc.identifier.other | 2-s2.0-85122912617 | en_US |
dc.identifier.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85122912617&origin=inward | en_US |
dc.identifier.uri | http://cmuir.cmu.ac.th/jspui/handle/6653943832/72774 | - |
dc.description.abstract | An algebraic system is a structure consisting of a nonempty set together with a sequence of operations and a sequence of relations on it. A relational hypersubstitution for algebraic systems is a mapping which maps any operation to a term and maps any relation to a relational term preserving its arities. The set of all such relational hypersubstitutions for algebraic systems forms a monoid. In this paper, we characterize the set of all intra-regular elements of the monoid of all relational hypersubstitutions of type ((m), (n)) and show that the set of all intra-regular elements, set of all left (right) regular elements and the set of all completely regular elements of Relhyp((m), (n)) are the same. | en_US |
dc.subject | Computer Science | en_US |
dc.subject | Mathematics | en_US |
dc.title | All intra-regular and relationship between some regular submonoids of Relhyp((m),(n)) | en_US |
dc.type | Journal | en_US |
article.title.sourcetitle | International Journal of Mathematics and Computer Science | en_US |
article.volume | 17 | 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.