|
СТ |
Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially |
2001 |
Groote J. F., Zantema H. |
|
|
|
Lecture Notes in Computer Science |
06.02.2002 |
|
П |
Basic Process Algebra with Iteration: Completeness of Its Equational Axioms |
1993 |
Fokkink W. J., Zantema H. |
|
|
Univ. Utrecht |
|
28.09.1999 |
|
П |
Simple Termination Revisited |
1993 |
Middeldorf A., Zantema H. |
|
|
Univ. Utrecht |
|
28.09.1999 |
|
СТ |
Relative Undecidability in Term Rewriting |
1997 |
Geser A., Middeldorp A., Ohlebusch E., Zantema H. |
|
|
|
Lecture Notes in Computer Science |
18.07.1997 |
|
СТ |
Termination of Logic Programs using Semantic Unification |
1996 |
Arts T., Zantema H. |
|
|
|
Lecture Notes in Computer Science |
30.03.1996 |
|
СТ |
Dummy Elimination: Making Termination Easier |
1995 |
Ferreira M.C. F., Zantema H. |
Lecture Notes in Computer Science |
|
|
Fundamentals of Computation Theory |
18.10.1995 |
|
СТ |
A Complete Characterization of Termination of 0 1 - 1 0 |
1995 |
Zantema H., Geser A. |
|
|
|
Lecture Notes in Computer Science |
27.04.1995 |
|
СТ |
Syntactical Analysis of Total Termination |
1994 |
Ferreira M.C. F., Zantema H. |
|
|
|
Lecture Notes in Computer Science |
01.11.1994 |
|
СТ |
Total Termination of Term Rewriting |
1993 |
Ferreira M.C. F., Zantema H. |
|
|
|
Lecture Notes in Computer Science |
09.07.1993 |
