Efficient Ground Completion: An O(n log n) Algorithm for Generating Reduced Sets of Ground Rewrite Rules Equivalent to a Set of Ground Equations E

On the Connections between Rewriting and Formal Language Theory

RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications

Representation of a class of nondeterministic semiautomata by canonical words

Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday

On s-regular preffix-rewriting systems and automatic structures

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics

Congruence closure of compressed terms in polynomial time

FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems

Constructing rewrite-based decision procedures for embeddings and termination

MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction