当前位置:
X-MOL 学术
›
Theor. Comput. Sci.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
On bounded linear codes and the commutative equivalence
Theoretical Computer Science ( IF 1.1 ) Pub Date : 2020-11-20 , DOI: 10.1016/j.tcs.2020.11.031 Arturo Carpi , Flavio D'Alessandro
中文翻译:
关于有界线性码和可交换对等
更新日期:2020-12-13
Theoretical Computer Science ( IF 1.1 ) Pub Date : 2020-11-20 , DOI: 10.1016/j.tcs.2020.11.031 Arturo Carpi , Flavio D'Alessandro
The problem of the commutative equivalence of semigroups generated by semi-linear languages is studied. In particular conditions ensuring that the Kleene closure of a bounded semi-linear code is commutatively equivalent to a regular language are investigated.
中文翻译:
关于有界线性码和可交换对等
研究了由半线性语言产生的半群的交换对等问题。在特定条件下,研究了确保有界半线性代码的Kleene闭包可交换地等同于常规语言的情况。