Authors: FOKKINK W ZANTEMA H

Citation: W. Fokkink et H. Zantema, TERMINATION MODULE EQUATIONS BY ABSTRACT COMMUTATION WITH AN APPLICATION TO ITERATION, Theoretical computer science, 177(2), 1997, pp. 407-423

Authors: MIDDELDORP A ZANTEMA H

Citation: A. Middeldorp et H. Zantema, SIMPLE TERMINATION OF REWRITE SYSTEMS, Theoretical computer science, 175(1), 1997, pp. 127-158

Authors: ZANTEMA H

Citation: H. Zantema, TOTAL TERMINATION OF TERM REWRITING IS UNDECIDABLE, Journal of symbolic computation, 20(1), 1995, pp. 43-60

Authors: ZANTEMA H

Citation: H. Zantema, TERMINATION OF TERM REWRITING - INTERPRETATION AND TYPE ELIMINATION, Journal of symbolic computation, 17(1), 1994, pp. 23-50

Authors: FOKKINK W ZANTEMA H

Citation: W. Fokkink et H. Zantema, BASIC PROCESS ALGEBRA WITH ITERATION - COMPLETENESS OF ITS EQUATIONALAXIOMS, Computer journal, 37(4), 1994, pp. 259-267

Authors: FOKKINK W ZANTEMA H

Citation: W. Fokkink et H. Zantema, BASIC PROCESS ALGEBRA WITH ITERATION - COMPLETENESS OF ITS EQUATIONALAXIOMS, Computer journal, 37(4), 1994, pp. 259-267