Please use this identifier to cite or link to this item: https://dspace.ctu.edu.vn/jspui/handle/123456789/47785
Title: Set decipherable languages and generators
Authors: Tran, Vinh Duc
Keywords: Codes; ω-codes
Dominoes
Formal languages
Generators
Infinite words
Issue Date: 2020
Series/Report no.: Journal of Computer Science and Cybernetics;Vol. 36, No. 04 .- P.381–392
Abstract: We 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ω.
URI: https://dspace.ctu.edu.vn/jspui/handle/123456789/47785
ISSN: 1813-9663
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: 44.215.110.142


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