Bild mit Unilogo
homeicon uni sucheicon suche kontakticon kontakt impressicon impressum
unilogo Universität Stuttgart 
Institut für Formale Methoden der Informatik

Abteilung Theoretische Informatik

 

Bertol


1996:

Trace rewriting: Computing normal forms in time O(n log n)

Michael Bertol, Volker Diekert

Proceedings of the "13th Symposium on Theoretical Aspects of Computer Science (STACS)" LNCS 1046, 269-280, Springer 1996, ps File. ps.gz File (© Springer-Verlag).

1995:

Efficient rewriting in cograph trace monoids

Michael Bertol

Proceedings of the 10th Fundamentals of Computation Theory (FCT '95), Dresden (Germany) 1995 ps File. ps.gz File (© Springer-Verlag).

Nonfinite Aximatizability of the Equational Theory of Shuffle

Zoltán Ésik, Michael Bertol

Acta Informatica 35(6), 505-539 (1998) ps File. ps.gz File (© Springer-Verlag).

The Tautologies over a finite set are context-free

Michael Bertol, Klaus Reinhardt

Bulletin of the European Association for Theoretical Computer Science Number 57. ps File. ps.gz File.

1994:

On efficient reduction-algorithms for some trace rewriting systems

Michael Bertol, Volker Diekert

Proceedings of "Term Rewriting", LNCS 909, 114-126, Springer 1993 ps File.ps.gz File (© Springer-Verlag).