1. LRC Digital Repository
  2. Tạp chí Khoa học
  3. Tin học và Điều khiển học (Journal of Computer Science and Cybernetics)
Please use this identifier to cite or link to this item: https://dspace.ctu.edu.vn/jspui/handle/123456789/47785
Full metadata record
DC FieldValueLanguage
dc.contributor.authorTran, Vinh Duc-
dc.date.accessioned2021-03-23T03:32:41Z-
dc.date.available2021-03-23T03:32:41Z-
dc.date.issued2020-
dc.identifier.issn1813-9663-
dc.identifier.urihttps://dspace.ctu.edu.vn/jspui/handle/123456789/47785-
dc.description.abstractWe investigate the problem to characterize whether the infinite product of a given language L is generated by an ω-code. Up to now, this problem is open even if language L is a finite language. In this work, we consider a class of languages named ω-set decipherable languages which are very close to the ω-codes. We solve the problem in the restricted case where L is ω-set decipherable and L* is the greatest generator of Lω.vi_VN
dc.language.isoenvi_VN
dc.relation.ispartofseriesJournal of Computer Science and Cybernetics;Vol. 36, No. 04 .- P.381–392-
dc.subjectCodes; ω-codesvi_VN
dc.subjectDominoesvi_VN
dc.subjectFormal languagesvi_VN
dc.subjectGeneratorsvi_VN
dc.subjectInfinite wordsvi_VN
dc.titleSet decipherable languages and generatorsvi_VN
dc.typeArticlevi_VN
Appears in Collections:Tin học và Điều khiển học (Journal of Computer Science and Cybernetics)

Files in This Item:
File Description SizeFormat 
_file_
  Restricted Access		2.51 MBAdobe PDF
Your IP: 3.133.86.172
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.