On a conjecture about Parikh matrices.

Theor. Comput. Sci.(2016)

引用 21|浏览101
暂无评分
摘要
Based on Salomaa's characterization of M-equivalence, Atanasiu conjectured that a certain natural generalization of ME-equivalence solves the injectivity problem of Parikh matrices for the ternary alphabet. This paper refutes his conjecture but continues to study the interesting proposed Thue system. Characterization of certain irreducible elementary transformations under this system is obtained. Furthermore, these transformations are further scrutinized in terms of their replaceability by simpler ones.
更多
查看译文
关键词
Parikh matrix mapping,Parikh matrices,Injectivity problem,M-equivalence,Atanasiu's system,Subword occurrences
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要