| |
| 1998 | ||
|---|---|---|
| 6 | EE | Zoltán Ésik, Michael Bertol: Nonfinite Axiomatizability of the Equational Theory of Shuffle. Acta Inf. 35(6): 505-539 (1998) |
| 1996 | ||
| 5 | Michael Bertol, Volker Diekert: Trace Rewriting: Computing Normal Forms in Time O(n log n). STACS 1996: 269-280 | |
| 1995 | ||
| 4 | Michael Bertol: Efficient Rewriting in Cograph Trace Monoids. FCT 1995: 146-155 | |
| 3 | Zoltán Ésik, Michael Bertol: Nonfinite Axiomatizability of the Equational Theory of Shuffle. ICALP 1995: 27-38 | |
| 2 | Michael Bertol, Klaus Reinhardt: The Tautologies over a Finite Set are Context-Free. Bulletin of the EATCS 57: (1995) | |
| 1993 | ||
| 1 | Michael Bertol, Volker Diekert: On Efficient Reduction Algorithms for Some Trace Rewriting Systems. Term Rewriting 1993: 114-126 | |
| 1 | Volker Diekert | [1] [5] |
| 2 | Zoltán Ésik | [3] [6] |
| 3 | Klaus Reinhardt | [2] |