Natural decidable classes of one-rule systems

Define other natural classes of one-rule string-rewriting systems for which global or local termination is decidable.

Background

Known decidable subclasses include grid rules and single-threaded systems. The paper explicitly asks for additional natural restrictions under which either global or local termination can be decided.

References

Define other natural classes of one-rule SRSs for which termination, global or local, is decidable.

— String Rewriting Systems: Brief Introduction and Sample of Open Problems  (2608.19397 - Kfoury, 19 Aug 2026) in Section 6, immediately following the problem on one-rule termination