On deciding confluence of finite string-rewriting systems modulo partial commutativity (Q1262758): Difference between revisions

The author studies the problem of confluent and coherent equational rewriting in the case of string rewriting on partially commutative alphabets. He shows the decidability of the R,E-convergence of a finite E- terminating string-rewriting system R on an alphabet \(\Sigma\), where E is the convergence induced by a partial commutativy relation C on \(\Sigma\).