Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Michael Bertol
1990 – 1999
- 1998
[j2]Zoltán Ésik, Michael Bertol: Nonfinite Axiomatizability of the Equational Theory of Shuffle. Acta Inf. 35(6): 505-539 (1998)- 1996
[b1]Michael Bertol: Effiziente Normalform-Algorithmen für Ersetzungssysteme über frei partiell kommutativen Monoiden. Universität Stuttgart 1996, pp. I-VIII, 1-114
[c4]Michael Bertol, Volker Diekert: Trace Rewriting: Computing Normal Forms in Time O(n log n). STACS 1996: 269-280- 1995
[j1]Michael Bertol, Klaus Reinhardt: The Tautologies over a Finite Set are Context-Free. Bulletin of the EATCS 57 (1995)
[c3]
[c2]Zoltán Ésik, Michael Bertol: Nonfinite Axiomatizability of the Equational Theory of Shuffle. ICALP 1995: 27-38- 1993
[c1]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
last updated on 2012-09-10 15:45 CEST by the dblp team



