On deciding confluence of finite string-rewriting systems modulo partial commutativity (Q1262758): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(89)90019-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1984954584 / rank | |||
Normal rank | |||
Revision as of 00:38, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On deciding confluence of finite string-rewriting systems modulo partial commutativity |
scientific article |
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
