Dòng Nội dung
1
Set Decipherable Languages And Generators / Tran Vinh Due // Tạp chí Tin học và Điều khiển học = Journal of Computer Science And Cybernetics . - 2020. - tr. 85-98. - ISSN: 1813-9663



Ký hiệu phân loại (DDC): 495.7
We investigate the problem to characterize whether the infinite product of a given language L is generated by an w-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 w-set decipherable languages winch are veryclose to the w-codes. We solve the problem in the restricted case where L is w-set decipherable and L* is the greatest generator of LB .
 Số bản sách: (0) Tài liệu số: (1)