Termination of {aa ⅾ bc, bb ⅾ ac, cc ⅾ ab}

Linear bounded automata and rewrite systems: influence of initial configurations on decision properties

TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1

String-rewriting systems

String-rewriting systems

An On-line Problem Database

RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications

Decision problems for semi-Thue systems with a few rules

Theoretical Computer Science - Insightful theory

Effective preprocessing in SAT through variable and clause elimination

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing