Searching for authors named Hans Zantema – sorted by Relevance.
36 documents found, showing 1 through 10.
Next 10 →
-
The Termination Hierarchy for Term Rewriting
- …The Termination Hierarchy for Term Rewriting H. Zantema Utrecht University, Department of Computer…
- Add To MetaCart
-
Termination of Term Rewriting
- …Termination of Term Rewriting Hans Zantema Dept. of Computer Science, Universiteit Utrecht, P…
- Cited by 20 (6 self) – Add To MetaCart
-
Total Termination of Term Rewriting is Undecidable
- …Total termination of term rewriting is undecidable Hans Zantema Utrecht University, Department…
- Cited by 7 (2 self) – Add To MetaCart
-
Reducing right-hand sides for termination
- …Reducing right hand sides for termination Hans Zantema Department of Computer Science, TU…
- Cited by 4 (1 self) – Add To MetaCart
-
Termination of Term Rewriting: Interpretation and Type Elimination
- … elimination H. Zantema Utrecht University, Department of Computer Science P.O. box 80.089, 3508 TB Utrecht…
- Cited by 78 (13 self) – Add To MetaCart
-
Decision Trees: Equivalence and Propositional Operations
- …Decision Trees: Equivalence and Propositional Operations Hans Zantema Department of Computer…
- Cited by 3 (3 self) – Add To MetaCart
-
Finding Small Equivalent Decision Trees is Hard
- …Finding small equivalent decision trees is hard Hans Zantema and Hans Bodlaender Department…
- Cited by 7 (1 self) – Add To MetaCart
-
A Complete Characterization of Termination of. . .
- …A complete characterization of termination of 0 p 1 q ! 1 r 0 s Hans ZANTEMA Universiteit…
- Add To MetaCart
-
A Complete Equational Axiomatization for BPAdelta epsilon with Prefix Iteration
- … Zantema Utrecht University Departments of Philosophy and of Computer Science Utrecht, The Netherlands…
- Add To MetaCart
-
Liveness in Rewriting
- … and Hans Zantema ISSN 0935-3232 Aachener Informatik Berichte AIB-2002-11 RWTH Aachen Department…
- Cited by 15 (6 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
