当前位置: X-MOL 学术Int. J. Found. Comput. Sci. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A New Study of Parikh Matrices Restricted to Terms
International Journal of Foundations of Computer Science ( IF 0.8 ) Pub Date : 2020-08-13 , DOI: 10.1142/s0129054120500306
Zi Jing Chern 1 , K. G. Subramanian 2 , Azhana Ahmad 1 , Wen Chean Teh 1
Affiliation  

Parikh matrices as an extension of Parikh vectors are useful tools in arithmetizing words by numbers. This paper presents a further study of Parikh matrices by restricting the corresponding words to terms formed over a signature. Some [Formula: see text]-equivalence preserving rewriting rules for such terms are introduced. A characterization of terms that are only [Formula: see text]-equivalent to themselves is studied for binary signatures. Graphs associated to the equivalence classes of [Formula: see text]-equivalent terms are studied with respect to graph distance. Finally, the preservation of [Formula: see text]-equivalence under the term self-shuffle operator is studied.

中文翻译:

限项 Parikh 矩阵的新研究

Parikh 矩阵作为 Parikh 向量的扩展是用数字对单词进行算术运算的有用工具。本文通过将相应的单词限制为在签名上形成的术语来进一步研究 Parikh 矩阵。引入了一些[公式:见正文]-等价保留重写规则。对于二进制签名,研究了仅 [公式:参见文本] 与自身等效的术语的表征。与[公式:参见文本]等价项的等价类相关的图在图距离方面进行了研究。最后,研究了术语自洗牌算子下[公式:见正文]-等价性的保存。
更新日期:2020-08-13
down
wechat
bug