# Michael Bertol

According to our database

^{1}, Michael Bertol## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

1998

Nonfinite Axiomatizability of the Equational Theory of Shuffle.

Acta Inf., 1998

1996

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

Proceedings of the STACS 96, 1996

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

PhD thesis, 1996

1995

The Tautologies over a Finite Set are Context-Free.

Bulletin of the EATCS, 1995

Nonfinite Axiomatizability of the Equational Theory of Shuffle.

Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

Efficient Rewriting in Cograph Trace Monoids.

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

1993

On Efficient Reduction Algorithms for Some Trace Rewriting Systems.

Proceedings of the Term Rewriting, 1993