Michael Bertol

According to our database, Michael Bertol authored at least 6 papers between 1993 and 1998.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

1998

Nonfinite Axiomatizability of the Equational Theory of Shuffle.

Zoltán Ésik, Michael Bertol

Acta Informatica, 1998

1996

Trace Rewriting: Computing Normal Forms in Time O(n log n).

Michael Bertol, Volker Diekert

Proceedings of the STACS 96, 1996

Effiziente Normalform-Algorithmen für Ersetzungssysteme über frei partiell kommutativen Monoiden.

Michael Bertol

PhD thesis, 1996

1995

The Tautologies over a Finite Set are Context-Free.

Michael Bertol, Klaus Reinhardt

Bull. EATCS, 1995

Efficient Rewriting in Cograph Trace Monoids.

Michael Bertol

Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

1993

On Efficient Reduction Algorithms for Some Trace Rewriting Systems.

Michael Bertol, Volker Diekert

Proceedings of the Term Rewriting, 1993