Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/76343
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Thodsaporn Kumduang | en_US |
dc.contributor.author | Khwancheewa Wattanatripop | en_US |
dc.contributor.author | Thawhat Changphas | en_US |
dc.date.accessioned | 2022-10-16T07:08:33Z | - |
dc.date.available | 2022-10-16T07:08:33Z | - |
dc.date.issued | 2021-01-01 | en_US |
dc.identifier.issn | 18140432 | en_US |
dc.identifier.issn | 18140424 | en_US |
dc.identifier.other | 2-s2.0-85111714838 | en_US |
dc.identifier.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85111714838&origin=inward | en_US |
dc.identifier.uri | http://cmuir.cmu.ac.th/jspui/handle/6653943832/76343 | - |
dc.description.abstract | Tree languages, sets of terms, have been more widely applied in automata theory and related fields. In this paper, a specific class of tree languages, which induced by terms of a fixed variable, is introduced. Under non-deterministic superposition operations of tree languages, the power clone of tree languages with fixed variables is constructed and some of their properties are investigated. These lead us to propose certain semigroups consisting of the set of tree languages with fixed variables and different binary associative operations. | en_US |
dc.subject | Computer Science | en_US |
dc.subject | Mathematics | en_US |
dc.title | Tree languages with fixed variables and their algebraic structures | en_US |
dc.type | Journal | en_US |
article.title.sourcetitle | International Journal of Mathematics and Computer Science | en_US |
article.volume | 16 | en_US |
article.stream.affiliations | Khon Kaen University | 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.