|
DDC
| 495.7 | |
Tác giả CN
| Tran, Vinh Due | |
Nhan đề
|
Set Decipherable Languages And Generators
/ Tran Vinh Due | |
Tóm tắt
| 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 . | |
Từ khóa tự do
| Codes | |
Từ khóa tự do
| Dominoes | |
Từ khóa tự do
| Generators | |
Từ khóa tự do
| Formal languages | |
Nguồn trích
| Tạp chí Tin học và Điều khiển học = Journal of Computer Science And Cybernetics 2020tr. 85-98
Số: 04
Tập: 36 |
| |
000
| 00000nab#a2200000ui#4500 |
|---|
| 001 | 52531 |
|---|
| 002 | 9 |
|---|
| 004 | A42364ED-9BD8-45B8-B57D-ABB875580804 |
|---|
| 005 | 202410110915 |
|---|
| 008 | 081223s VN| vie |
|---|
| 009 | 1 0 |
|---|
| 039 | |y20241011091504|ztainguyendientu |
|---|
| 040 | |aACTVN |
|---|
| 041 | |avie |
|---|
| 044 | |avm |
|---|
| 082 | |a495.7 |
|---|
| 100 | 10|aTran, Vinh Due |
|---|
| 245 | |a
Set Decipherable Languages And Generators
/ |cTran Vinh Due |
|---|
| 520 | |aWe 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 . |
|---|
| 653 | |aCodes |
|---|
| 653 | |aDominoes |
|---|
| 653 | |aGenerators |
|---|
| 653 | |aFormal languages |
|---|
| 773 | 0 |tTạp chí Tin học và Điều khiển học = Journal of Computer Science And Cybernetics |d2020|gtr. 85-98|x1813-9663|v36|i04 |
|---|
| 890 | |a0|b0|c1|d1 |
|---|
| |
Không tìm thấy biểu ghi nào
|
|
|
|