From 53255b4a1151f70d4bcf7da8b5c66f7ff9557e40 Mon Sep 17 00:00:00 2001 From: James Mitchell Date: Tue, 27 Oct 2026 09:27:23 +0000 Subject: [PATCH] Reqriting -> rewriting --- docs/examples/1-relation/index.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/examples/1-relation/index.md b/docs/examples/1-relation/index.md index f41ed27..782071d 100644 --- a/docs/examples/1-relation/index.md +++ b/docs/examples/1-relation/index.md @@ -9,7 +9,7 @@ produce the corresponding decision procedure. In particular, the techniques described in this paper were applied to a large number of 1-relation monoids to determine their decidability. Of these, 501 required a modified version of the Knuth-Bendix procedure along with the termination solver `Matchbox` to find a -complete reqriting system, thus proving decidability. +complete rewriting system, thus proving decidability. On the following pages, you will find complete rewriting systems for 412 of those 501 presentations. The complete rewriting systems described here were