Travelled to:
1 × France
1 × Japan
1 × Spain
2 × USA
Collaborated with:
F.Otto J.Avenhaus ∅ A.Sattler-Klein P.Narendran J.Steinbach B.Benninghofen R.Göbel
Talks about:
rewrit (5) system (4) present (3) monoid (3) complet (2) string (2) group (2) finit (2) term (2) experiment (1)
Person: Klaus Madlener
DBLP: Madlener:Klaus
Contributed to:
Wrote 6 papers:
- RTA-1998-OttoSM #automation #convergence #finite #monad
- Automatic Monoids Versus Monoids with Finite Convergent Presentations (FO, ASK, KM), pp. 32–46.
- RTA-1996-Madlener #monad
- Applications of Rewrite Techniques in Monoids and Rings (KM), p. 260.
- ICALP-1991-MadlenerNO #monad #string #term rewriting
- A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups (KM, PN, FO), pp. 279–290.
- RTA-1989-AvenhausMS #named #term rewriting
- COMTES — An Experimental Environment for the Completion of Term Rewriting Systems (JA, KM, JS), pp. 542–546.
- RTA-1987-MadlenerO #finite #string #term rewriting
- Groups Presented by Certain Classes of Finite Length-Reducing String-Rewriting Systems (KM, FO), pp. 133–144.
- CADE-1986-AvenhausBGM #algebra #named #specification #term rewriting
- TRSPEC: A Term Rewriting Based System for Algebraic Specifications (JA, BB, RG, KM), pp. 665–667.