Citation: W. Fokkink et C. Verhoef, A CONSERVATIVE LOOK AT OPERATIONAL SEMANTICS WITH VARIABLE BINDING, Information and computation (Print), 146(1), 1998, pp. 24-54
Citation: L. Aceto et al., ON A QUESTION OF SALOMAA,A. - THE EQUATIONAL THEORY OF REGULAR EXPRESSIONS OVER A SINGLETON ALPHABET IS NOT FINITELY BASED, Theoretical computer science, 209(1-2), 1998, pp. 163-178
Citation: W. Fokkink et al., WITHIN ARMS REACH - COMPILATION OF LEFT-LINEAR REWRITE SYSTEMS VIA MINIMAL REWRITE SYSTEMS, ACM transactions on programming languages and systems, 20(3), 1998, pp. 679-706
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
Citation: W. Fokkink et H. Zantema, BASIC PROCESS ALGEBRA WITH ITERATION - COMPLETENESS OF ITS EQUATIONALAXIOMS, Computer journal, 37(4), 1994, pp. 259-267
Citation: W. Fokkink et H. Zantema, BASIC PROCESS ALGEBRA WITH ITERATION - COMPLETENESS OF ITS EQUATIONALAXIOMS, Computer journal, 37(4), 1994, pp. 259-267