Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/76343
Full metadata record
DC FieldValueLanguage
dc.contributor.authorThodsaporn Kumduangen_US
dc.contributor.authorKhwancheewa Wattanatripopen_US
dc.contributor.authorThawhat Changphasen_US
dc.date.accessioned2022-10-16T07:08:33Z-
dc.date.available2022-10-16T07:08:33Z-
dc.date.issued2021-01-01en_US
dc.identifier.issn18140432en_US
dc.identifier.issn18140424en_US
dc.identifier.other2-s2.0-85111714838en_US
dc.identifier.urihttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85111714838&origin=inwarden_US
dc.identifier.urihttp://cmuir.cmu.ac.th/jspui/handle/6653943832/76343-
dc.description.abstractTree 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.subjectComputer Scienceen_US
dc.subjectMathematicsen_US
dc.titleTree languages with fixed variables and their algebraic structuresen_US
dc.typeJournalen_US
article.title.sourcetitleInternational Journal of Mathematics and Computer Scienceen_US
article.volume16en_US
article.stream.affiliationsKhon Kaen Universityen_US
article.stream.affiliationsChiang Mai Universityen_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.