 | 1998 |
|---|
| 7 |       | Zoltán Ésik,
Michael Bertol:
Nonfinite Axiomatizability of the Equational Theory of Shuffle.
Acta Inf. 35(6): 505-539 (1998) |
| 1996 |
|---|
| 6 | | Michael Bertol,
Volker Diekert:
Trace Rewriting: Computing Normal Forms in Time O(n log n).
STACS 1996: 269-280 |
| 5 |  | Michael Bertol:
Effiziente Normalform-Algorithmen für Ersetzungssysteme über frei partiell kommutativen Monoiden.
Universität Stuttgart 1996: I-VIII, 1-114 |
| 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 |
Data released under the ODC-BY 1.0 license — See also our legal information page