Examples of one-rule trace-rewriting systems are given that are conflu
ent but not strongly confluent. This contrasts with the situation for
one-rule string-rewriting systems as well as with the situation for on
e-rule commutative string-rewriting systems.