|
СТ |
DISCOUNT: A System for Distributed Equational Deduction |
1995 |
Avenhaus J., Denzinger J., Fuchs M. |
|
|
|
Lecture Notes in Computer Science |
28.04.1995 |
|
СТ |
Higher Order Conditional Rewriting and Narrowing |
1994 |
Avenhaus J., Loria-Saenz C. |
|
|
|
Lecture Notes in Computer Science |
01.10.1994 |
|
СТ |
Operational Specifications with Built-Ins |
1994 |
Avenhaus J., Becker K. |
|
|
|
Lecture Notes in Computer Science |
26.03.1994 |
|
П |
Groups presented by finite two-monadic Church-Rosser Thue systems |
1984 |
Avenhaus J., Madlener K., Otto F. |
|
|
Univ. Kaiserslautern |
|
21.09.1991 |
|
П |
P-complete problems in free groups |
1980 |
Avenhaus J., Madlener K. |
|
|
Univ. Kaiserslautern |
|
20.09.1991 |
|
П |
Polynominal algorithms for problems in free groups based on Nielsen type arguments |
1980 |
Avenhaus J., Madlener K. |
|
|
Univ. Kaiserslautern |
|
19.09.1991 |
|
П |
On congruences and normal forms definable by term rewriting systems |
1984 |
Avenhaus J. |
|
|
Univ. Kaiserslautern |
|
19.09.1991 |
|
П |
String matching and algorithmic problems in free groups |
1979 |
Avenhaus J., Madlener K. |
|
|
Univ. Kaiserslautern |
|
19.09.1991 |
|
П |
AN ALGORITHM FOR THE WOLD PROBLEM IN HNN EXTENSIONS AND THE DEPENDENCE OF ITS COMPLEXITY ON THE GROUP REPRESENTATION |
1979 |
Avenhaus J., Madlener K. |
|
|
Univ. Kaiserslautern |
|
19.09.1991 |
|
П |
Polynominal time algorithms for the Nielsen redaction and related problems in free groups |
1980 |
Avenhaus J., Madlener K. |
|
|
Univ. Kaiserslautern |
|
19.09.1991 |
|
П |
On the termination of the Knuth-Bendix completion algorithm |
1984 |
Avenhaus J. |
|
|
Univ. Kaiserslautern |
|
14.09.1991 |
|
П |
Transforming Infinite Rewrite Systems into Finite Rewrite Systems by Embedding Techniques |
1989 |
Avenhaus J. |
|
|
Univ. Kaiserslautern |
|
08.06.1991 |
