Department of Information and Computing Sciences

Departement Informatica contact intern
people education research library calendar archive services jobs

technical reports : dr. H. Zantema

Hans  Zantema

select other reports

this selection

author dr. H. Zantema

reports (33)

techrep_id file title / author
UU-CS-2000-14 ps.gz
pdf
Resolution and binary decision diagrams cannot simulate each other polynomially
J. F. Groote, H. Zantema
UU-CS-2000-06 ps.gz
pdf
Binary decision diagrams by shared rewriting
J. van de Pol, H. Zantema
UU-CS-2000-04 ps.gz
pdf
Termination of Term Rewriting
H. Zantema
UU-CS-1999-31 ps.gz
pdf
Sizes of decision tables and decision trees
H. Zantema, H. L. Bodlaender
UU-CS-1999-22 ps.gz
pdf
The termination hierarchy for term rewriting
H. Zantema
UU-CS-1999-02 ps.gz
pdf
Finding small equivalent decision trees is hard
H. Zantema, H. L. Bodlaender
UU-CS-1998-14 ps.gz
pdf
Decision trees: equivalence and propositional operations
H. Zantema
UU-CS-1997-08 ps.gz
pdf
Termination of context-sensitive rewriting
H. Zantema
UU-CS-1996-45 ps.gz
pdf
Relative undecidability in term rewriting
A. Geser, A. Middeldorp, E. Ohlebusch, H. Zantema
UU-CS-1996-15 ps.gz
pdf
Transforming termination by self-labelling
A. Middeldorp, H. Ohsaki, H. Zantema
UU-CS-1996-03 ps.gz
pdf
Non-looping rewriting
H. Zantema, A. Geser
UU-CS-1995-17 ps.gz
pdf
Termination of constructor systems using semantic unification
T. Arts, H. Zantema
UU-CS-1995-10 ps.gz
pdf
A Complete Equational Axiomatization for BPA-delta-epsilon with Prefix Iteration
W. J. Fokkink, H. Zantema
UU-CS-1994-55 ps.gz
pdf
Total termination of term rewriting is undecidable
H. Zantema
UU-CS-1994-47 ps.gz
pdf
Dummy elimination: making termination easier
M. C. F. Ferreira, H. Zantema
UU-CS-1994-46 ps.gz
pdf
Well-foundedness of term orderings
M. C. F. Ferreira, H. Zantema
UU-CS-1994-44 ps.gz
pdf
A complete characterization of termination of 0^p 1^q -> 1^r 0^s
H. Zantema, A. Geser
UU-CS-1994-43 ps.gz
pdf
Rewrite systems for integer arithmetic
H. R. Walters, H. Zantema
UU-CS-1994-28 ps.gz
pdf
Syntactical analysis of total termination
M. C. F. Ferreira, H. Zantema
UU-CS-1994-20 ps.gz
pdf
Termination of logic programs via labelled term rewrite systems
T. Arts, H. Zantema
RUU-CS-93-41 ps.gz
pdf
Simple termination revisited
A. Middeldorp, H. Zantema
RUU-CS-93-40 ps.gz
pdf
Basic process algebra with iteration: completeness of its equational axioms
W. J. Fokkink, H. Zantema
RUU-CS-93-24 ps.gz
pdf
Termination of term rewriting by semantic labelling
H. Zantema
RUU-CS-92-43 pdf Derivation lengths in terms rewriting from interpretations in the naturals
V.C.S. Meeussen and H. Zantema
RUU-CS-92-42 pdf Total termination of term rewriting
M.C.F. Ferreira and H. Zantema
RUU-CS-92-38 pdf Termination of term rewriting by semantic labelling
H. Zantema
RUU-CS-92-14 pdf Termination of term rewriting by interpretation
H. Zantema
RUU-CS-91-42 pdf Classifying termination of term rewriting
H. Zantema
RUU-CS-91-18 pdf Termination of term rewriting, from many-sorted to one-sorted
H. Zantema
RUU-CS-90-28 pdf Longest segment problems
H. Zantema
RUU-CS-89-15 pdf Minimizing sums of addition chains
H. Zantema
RUU-CS-88-32 pdf Majority voting; characterization and algorithms
H. Zantema
RUU-CS-88-24 pdf Binary structures in program transformations
H. Zantema

indexed (co) authors

author group
Arts, dr. T. all reports Intelligent Systems all reports
Bodlaender, prof. dr. H.L. all reports Algorithmic Systems all reports
Ferreira, dr. M.C.F. all reports Intelligent Systems all reports
Zantema, dr. H. all reports Intelligent Systems all reports

BibTeX entries

@TECHREPORT{UUCS200014,
author = {Groote, J.~F. and Zantema, H.},
year = 2000,
title = {Resolution and binary decision diagrams cannot simulate each other polynomially},
number = {UU-CS-2000-14},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2000/2000-14.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2000/2000-14.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS200006,
author = {Pol, J.~van~de and Zantema, H.},
year = 2000,
title = {Binary decision diagrams by shared rewriting},
number = {UU-CS-2000-06},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2000/2000-06.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2000/2000-06.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS200004,
author = {Zantema, H.},
year = 2000,
title = {Termination of Term Rewriting},
number = {UU-CS-2000-04},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-2000/2000-04.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-2000/2000-04.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199931,
author = {Zantema, H. and Bodlaender, H.~L.},
year = 1999,
title = {Sizes of decision tables and decision trees},
number = {UU-CS-1999-31},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1999/1999-31.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1999/1999-31.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199922,
author = {Zantema, H.},
year = 1999,
title = {The termination hierarchy for term rewriting},
number = {UU-CS-1999-22},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1999/1999-22.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1999/1999-22.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199902,
author = {Zantema, H. and Bodlaender, H.~L.},
year = 1999,
title = {Finding small equivalent decision trees is hard},
number = {UU-CS-1999-02},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1999/1999-02.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1999/1999-02.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199814,
author = {Zantema, H.},
year = 1998,
title = {Decision trees: equivalence and propositional operations},
number = {UU-CS-1998-14},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1998/1998-14.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1998/1998-14.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199708,
author = {Zantema, H.},
year = 1997,
title = {Termination of context-sensitive rewriting},
number = {UU-CS-1997-08},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1997/1997-08.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1997/1997-08.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199645,
author = {Geser, A. and Middeldorp, A. and Ohlebusch, E. and Zantema, H.},
year = 1996,
title = {Relative undecidability in term rewriting},
number = {UU-CS-1996-45},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1996/1996-45.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1996/1996-45.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199615,
author = {Middeldorp, A. and Ohsaki, H. and Zantema, H.},
year = 1996,
title = {Transforming termination by self-labelling},
number = {UU-CS-1996-15},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1996/1996-15.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1996/1996-15.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199603,
author = {Zantema, H. and Geser, A.},
year = 1996,
title = {Non-looping rewriting},
number = {UU-CS-1996-03},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1996/1996-03.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1996/1996-03.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199517,
author = {Arts, T. and Zantema, H.},
year = 1995,
title = {Termination of constructor systems using semantic unification},
number = {UU-CS-1995-17},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1995/1995-17.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1995/1995-17.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199510,
author = {Fokkink, W.~J. and Zantema, H.},
year = 1995,
title = {A Complete Equational Axiomatization for BPA-delta-epsilon with Prefix Iteration},
number = {UU-CS-1995-10},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1995/1995-10.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1995/1995-10.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199455,
author = {Zantema, H.},
year = 1994,
title = {Total termination of term rewriting is undecidable},
number = {UU-CS-1994-55},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1994/1994-55.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1994/1994-55.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199447,
author = {Ferreira, M.~C.~F. and Zantema, H.},
year = 1994,
title = {Dummy elimination: making termination easier},
number = {UU-CS-1994-47},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1994/1994-47.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1994/1994-47.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199446,
author = {Ferreira, M.~C.~F. and Zantema, H.},
year = 1994,
title = {Well-foundedness of term orderings},
number = {UU-CS-1994-46},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1994/1994-46.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1994/1994-46.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199444,
author = {Zantema, H. and Geser, A.},
year = 1994,
title = {A complete characterization of termination of 0^p 1^q -> 1^r 0^s},
number = {UU-CS-1994-44},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1994/1994-44.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1994/1994-44.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199443,
author = {Walters, H.~R. and Zantema, H.},
year = 1994,
title = {Rewrite systems for integer arithmetic},
number = {UU-CS-1994-43},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1994/1994-43.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1994/1994-43.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199428,
author = {Ferreira, M.~C.~F. and Zantema, H.},
year = 1994,
title = {Syntactical analysis of total termination},
number = {UU-CS-1994-28},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1994/1994-28.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1994/1994-28.pdf}},
pubcat = {techreport}
}
@TECHREPORT{UUCS199420,
author = {Arts, T. and Zantema, H.},
year = 1994,
title = {Termination of logic programs via labelled term rewrite systems},
number = {UU-CS-1994-20},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1994/1994-20.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1994/1994-20.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9341,
author = {Middeldorp, A. and Zantema, H.},
year = 1993,
title = {Simple termination revisited},
number = {RUU-CS-93-41},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1993/1993-41.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1993/1993-41.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9340,
author = {Fokkink, W.~J. and Zantema, H.},
year = 1993,
title = {Basic process algebra with iteration: completeness of its equational axioms},
number = {RUU-CS-93-40},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1993/1993-40.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1993/1993-40.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9324,
author = {Zantema, H.},
year = 1993,
title = {Termination of term rewriting by semantic labelling},
number = {RUU-CS-93-24},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlps = {{http://www.cs.uu.nl/research/techreps/repo/CS-1993/1993-24.ps.gz}},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1993/1993-24.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9243,
author = {Meeussen, V.C.S. and Zantema, H.},
year = 1992,
title = {Derivation lengths in terms rewriting from interpretations in the naturals},
number = {RUU-CS-92-43},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1992/1992-43.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9242,
author = {Ferreira, M.C.F. and Zantema, H.},
year = 1992,
title = {Total termination of term rewriting},
number = {RUU-CS-92-42},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1992/1992-42.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9238,
author = {Zantema, H.},
year = 1992,
title = {Termination of term rewriting by semantic labelling},
number = {RUU-CS-92-38},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1992/1992-38.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9214,
author = {Zantema, H.},
year = 1992,
title = {Termination of term rewriting by interpretation},
number = {RUU-CS-92-14},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1992/1992-14.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9142,
author = {Zantema, H.},
year = 1991,
title = {Classifying termination of term rewriting},
number = {RUU-CS-91-42},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1991/1991-42.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9118,
author = {Zantema, H.},
year = 1991,
title = {Termination of term rewriting, from many-sorted to one-sorted},
number = {RUU-CS-91-18},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1991/1991-18.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS9028,
author = {Zantema, H.},
year = 1990,
title = {Longest segment problems},
number = {RUU-CS-90-28},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1990/1990-28.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8915,
author = {Zantema, H.},
year = 1989,
title = {Minimizing sums of addition chains},
number = {RUU-CS-89-15},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1989/1989-15.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8832,
author = {Zantema, H.},
year = 1988,
title = {Majority voting; characterization and algorithms},
number = {RUU-CS-88-32},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1988/1988-32.pdf}},
pubcat = {techreport}
}
@TECHREPORT{RUUCS8824,
author = {Zantema, H.},
year = 1988,
title = {Binary structures in program transformations},
number = {RUU-CS-88-24},
institution = {Department of Information and Computing Sciences, Utrecht University},
urlpdf = {{http://www.cs.uu.nl/research/techreps/repo/CS-1988/1988-24.pdf}},
pubcat = {techreport}
}