About the rewriting systems produced by the Knuth-Bendix completion algorithm (Q1836978): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(83)90009-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2093318042 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3659160 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A complete proof of correctness of the Knuth-Bendix completion algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5581665 / rank | |||
Normal rank | |||
Latest revision as of 17:13, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | About the rewriting systems produced by the Knuth-Bendix completion algorithm |
scientific article |
Statements
About the rewriting systems produced by the Knuth-Bendix completion algorithm (English)
0 references
1983
0 references
congruence
0 references
free F-algebra
0 references
complete rewriting system
0 references
