On Efficient Reduction Algorithms for Some Trace Rewriting Systems. - Michael Bertol; Volker Diekert (Term Rewriting, 1993)

Efficient Rewriting in Cograph Trace Monoids. - Michael Bertol (FCT, 1995)

The Tautologies over a Finite Set are Context-Free. - Michael Bertol; Klaus Reinhardt (Bull. EATCS, 1995)

Effiziente Normalform-Algorithmen für Ersetzungssysteme über frei partiell kommutativen Monoiden. - Michael Bertol (1996)

Trace Rewriting: Computing Normal Forms in Time O(n log n). - Michael Bertol; Volker Diekert (STACS, 1996)

Nonfinite Axiomatizability of the Equational Theory of Shuffle. - Zoltán Ésik; Michael Bertol (Acta Informatica, 1998)