Zantema, H. & Bodlaender, H.L. (2002). Sizes of ordered decision trees. International Journal of Foundations of Computer Science, 13, 445-458.
|
Pol, W.L. van der & Zantema, H. (2000). Binary decision diagrams by shared rewriting. (UU-CS 2000-06). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Zantema, H. & Bodlaender, H.L. (2000). Finding small equivalent decision trees is hard. International Journal of Foundations of Computer Science, 11(2), 343-354.
|
Groote, J.F. & Zantema, H. (2000). Resolution and binary decision diagrams cannot simulate each other polynomially. (UU-CS 2000-14). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Zantema, H. (2000). Termination of Term Rewriting. (UU-CS 2000-04). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Zantema, H. & Lemmens, P.W.H. (1999). Beschrijven en Bewijzen. Delft: Delft University Press.
|
Zantema, H. & Bodlaender, H.L. (1999). Finding small equivalent decision trees is hard. (UU-CS 1999-02). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Zantema, H. & Bodlaender, H.L. (1999). Sizes of decision tables and decision trees. (UU-CS 1999-31). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Zantema, H. (1999). The termination hierarchy for term rewriting. (UU-CS 1999-22). Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Zantema, H. (1998). Decision trees: Equivalence and propositional operations. In H. La Poutre & J. van den Herik (Eds.), Proceedings 10th Netherlands/Belgium Conference on Artificial Intelligence (NAIC'98) (pp. 157-166).
|
Zantema, H. (1998). Decision trees: equivalence and propositional operations. (UU-CS 1998-14). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Geser, A., Middeldorp, A., Ohlebusch, E. & Zantema, H. (1997). Relative undecidability in the termination hierarchy of single rewrite rules. In M. Bidoit & M. Dauchet (Eds.), Proceedings Theory and Practice of Software Development (TAPSOFT97, CAAP/FASE) Vol. 1214. Lecture Notes in Computer Science (pp. 237-248). Berlin, Germany: Springer Verlag.
|
Geser, A., Middeldorp, A., Ohlebusch, E. & Zantema, H. (1997). Relative undicidability in term rewriting. In D. van Dalen (Ed.), Proceedings of the Conference of the European Association of Computer Science Logic (CSL96) Vol. 1258. Lecture Notes in Computer Science (pp. 150-166). Berlin, Germany: Springer Verlag.
|
Middeldorp, A. & Zantema, H. (1997). Simple Termination of Rewrite Systems. Theoretical Computer Science, 175, 127-158.
|
Fokkink, W.J. & Zantema, H. (1997). Termination modulo equations by abstract commutation with an application to iteration. Theoretical Computer Science, 177, 407-423.
|
Zantema, H. (1997). Termination of context-sensitive rewriting. (UU-CS 1997-08). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Zantema, H. (1997). Termination of context-sensitive rewriting. In H. Comon (Ed.), Proceedings of the 8th Conference on Rewriting Techniques and Applications Vol. 1232. Lecture Notes in Computer Science (pp. 172-186). Berlin, Germany: Springer Verlag.
|
Zantema, H. (1996). Decision trees: Equivalence and propositional operations. In H. la Poutre & J. van den Herik (Eds.), Proceedings of the 10th Netherlands/Belgium Conference on Artificial Intelligence (NAIC'98) (pp. 157-166).
|
Zantema, H. (1996). Non-looping rewriting. (UU-CS 1996-03). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Geser, A. & Zantema, H. (1996). Relative undecidability in term rewriting. (UU-CS 1996-45). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Fokkink, W.J. & Zantema, H. (1996). Termination modulo equations by abstract commutation with an application to iteration. Logic Group preprint series, 153.
|
Arts, T. & Zantema, H. (1996). Termination of logic using semantic unification. In M. Proietti (Ed.), Proceedings of the Fifth International Workshop on Logic Program Synthesis and Transformation (pp. 219-233). Berlin, Germany: Springer Verlag.
|
Ferreira, M.C.F. & Zantema, H. (1996). Total termination of term rewriting. Applicable algebra in engineering, communication and computing, 7(2), 133-162.
|
Zantema, H. (1996). Total termination of term rewriting in undecdable. Journal of symbolic computation, 20, 43-60.
|
Middeldorp, A. & Zantema, H. (1996). Transforming termination by self-labelling. (UU-CS 1996-15). Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Middeldorp, A., Ohsaki, H. & Zantema, H. (1996). Transforming termination by self-labelling. In M. McRobbie & J. Slaney (Eds.), Proceedings of the 13th International Conference on Automated Deduction (CADE) (pp. 373-387). Springer Verlag.
|
Fokkink, W.J. & Zantema, H. (1995). A Complete Equational Axiomatization for BPA-delta-epsilon with Prefix Iteration. (UU-CS 1995-10). Utrecht: Utrecht University.
|
Arts, T. & Zantema, H. (1995). Termination of constructor systems using semantic unification. (UU-CS 1995-17). Utrecht: Utrecht University.
|
Zantema, H. (1994). A complete characterization of termination of 0^p 1^q -> 1^r 0^s. (UU-CS 1994-44). Utrecht: Utrecht University.
|
Ferreira, M.C.F. & Zantema, H. (1994). Dummy elimination: making termination easier. (UU-CS 1994-47). Utrecht.
|
Walters, E. & Zantema, H. (1994). Rewrite systems for integer arithmetic. (UU-CS 1994-43). Utrecht.
|
Ferreira, M.C.F. & Zantema, H. (1994). Syntactical analysis of total termination. (UU-CS 1994-28). Utrecht.
|
Arts, T. & Zantema, H. (1994). Termination of logic programs via labelled term rewrite systems. (UU-CS 1994-20). Utrecht.
|
Zantema, H. (1994). Total termination of term rewriting is undecidable. (UU-CS 1994-55). Utrecht.
|
Ferreira, M.C.F. & Zantema, H. (1994). Well-foundedness of term orderings. (UU-CS 1994-46). Utrecht.
|
Fokkink, W.J. & Zantema, H. (1993). Basic process algebra with iteration: completeness of its equational axioms. (RUU-CS 93-40). Utrecht.
|
Middeldorp, A. & Zantema, H. (1993). Simple termination revisited. (RUU-CS 93-41). Utrecht.
|
Zantema, H. (1993). Termination of term rewriting by semantic labelling. (RUU-CS 93-24). Utrecht.
|
Meeussen, V.C.S. & Zantema, H. (1992). Derivation lengths in terms rewriting from interpretations in the naturals. (RUU-CS 92-43). Utrecht.
|
Zantema, H. (1992). Termination of term rewriting by interpretation. (RUU-CS 92-14). Utrecht.
|
Zantema, H. (1992). Termination of term rewriting by semantic labelling. (RUU-CS 92-38). Utrecht.
|
Ferreira, M.C.F. & Zantema, H. (1992). Total termination of term rewriting. (RUU-CS 92-42). Utrecht.
|
Zantema, H. (1991). Classifying termination of term rewriting. (RUU-CS 91-42). Utrecht.
|
Zantema, H. (1991). Termination of term rewriting, from many-sorted to one-sorted. (RUU-CS 91-18). Utrecht.
|
Zantema, H. (1990). Longest segment problems. (RUU-CS 90-28). Utrecht.
|
Zantema, H. (1989). Minimizing sums of addition chains. (RUU-CS 89-15). Utrecht.
|
Zantema, H. (1988). Binary structures in program transformations. (RUU-CS 88-24). Utrecht.
|
Zantema, H. (1988). Majority voting; characterization and algorithms. (RUU-CS 88-32). Utrecht.
|
webmaster@cs.uu.nl,
Thu, 20 Jun 2013 10:01:13 +0200
←
Departement Informatica, Universiteit Utrecht