当前位置:
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.)
Reprint of: ω-Lyndon words
Theoretical Computer Science ( IF 0.9 ) Pub Date : 2020-05-26 , DOI: 10.1016/j.tcs.2020.05.037 Mickaël Postic , Luca Q. Zamboni
中文翻译:
转载:ω-林登词
更新日期:2020-05-26
Theoretical Computer Science ( IF 0.9 ) Pub Date : 2020-05-26 , DOI: 10.1016/j.tcs.2020.05.037 Mickaël Postic , Luca Q. Zamboni
Let be a finite non-empty set and ⪯ a total order on verifying the following lexicographic like condition: For each and , if then for all . A word is called ω-Lyndon if for each proper suffix y of x. A finite word is called ω-Lyndon if for each proper suffix v of w. In this note we prove that every infinite word may be written uniquely as a non-increasing product of ω-Lyndon words.
中文翻译:
转载:ω-林登词
让 是有限的非空集,并且on的总阶 验证以下类似词典的条件:对于每个 和 如果 然后 对所有人 。一个字被称为ω- Lyndon如果针对每个适当的后缀ý的X。一个有限的词被称为ω- Lyndon如果每一个正确的后缀v的w ^。在本注释中,我们证明了每个无限词都可以作为ω - Lyndon词的非递增乘积唯一地写。