A finiteness condition for rewriting systems

A Completion Procedure for Finitely Presented Groups That Is Based on Word Cycles

Journal of Automated Reasoning

Undecidability Results for Monoids with Linear-Time Decidable Word Problems

ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation

Undecidable properties of monoids with word problem solvable in linear time. Part II: cross sections and homological and homotopical finiteness conditions

Theoretical Computer Science

Geometry and concurrency: a user's guide

Mathematical Structures in Computer Science

String rewriting and homology of monoids

Mathematical Structures in Computer Science

Finite derivation type for Rees matrix semigroups

Theoretical Computer Science

Algebraic topology and concurrency

Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics

On properties not inherited by monoids from their Schützenberger groups

Information and Computation

Homotopy bases and finite derivation type for Schützenberger groups of monoids

Journal of Symbolic Computation