On deciding confluence of finite string-rewriting systems modulo partial commutativity (Q1262758)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On deciding confluence of finite string-rewriting systems modulo partial commutativity |
scientific article; zbMATH DE number 4125001
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On deciding confluence of finite string-rewriting systems modulo partial commutativity |
scientific article; zbMATH DE number 4125001 |
Statements
On deciding confluence of finite string-rewriting systems modulo partial commutativity (English)
0 references
1989
0 references
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\).
0 references
confluence
0 references
commutativity
0 references
string rewriting
0 references
0 references
0 references
0 references
0.92792773
0 references
0.9230353
0 references
0.9116353
0 references
0.90463567
0 references
0.9002727
0 references
0.8997633
0 references
