|
П |
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 |
|
П |
P-complete problems in free groups |
1980 |
Avenhaus J., Madlener K. |
|
|
Univ. Kaiserslautern |
|
20.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 |
|
П |
Polynominal algorithms for problems in free groups based on Nielsen type arguments |
1980 |
Avenhaus J., Madlener K. |
|
|
Univ. Kaiserslautern |
|
19.09.1991 |
|
П |
Eine E-Frattini-Einbettung in eine einfache Untergruppe einer endlich dargestellten Gruppe |
1980 |
Madlener K., Otto F. |
|
|
Univ. Kaiserslautern |
|
15.05.1991 |
|
П |
Derivation-Bounded Groups |
1981 |
Madlener K., Otto F. |
|
|
Univ. Kaiserslautern |
|
20.09.1991 |
|
П |
On the quality of pseudo-natural algorithms for the word problem |
1983 |
Madlener K., Otto F. |
|
|
Univ. Kaiserslautern |
|
25.09.1991 |
|
П |
On finitely generated non-finite presentations of groups and monoids |
1983 |
Madlener K., Otto F. |
|
|
Univ. Kaiserslautern |
|
25.09.1991 |
|
П |
Groups presented by finite two-monadic Church-Rosser Thue systems |
1984 |
Avenhaus J., Madlener K., Otto F. |
|
|
Univ. Kaiserslautern |
|
21.09.1991 |
|
П |
Pseudo-natural algorithms for decision problems in certain types of string-rewriting systems |
1984 |
Madlener K., Otto F. |
|
|
Univ. Kaiserslautern |
|
19.11.1991 |
|
П |
Commutativity in groups presented by finite Church-Rosser Thue systems |
1986 |
Madlener K., Otto F. |
|
|
Univ. Kaiserslautern |
|
22.10.1991 |
|
П |
Application of rewriting techniques to solve the generalized word problem in groups |
1989 |
Kuhn N., Madlener K. |
|
|
Univ. Kaiserslautern |
|
19.09.1991 |
|
П |
A Test For Lambda-Confluence For Certain Prefix Rewriting Systems With Applications To The Generalized Word Problem |
1990 |
Kuhn N., Madlener K., Otto F. |
|
|
Univ. Kaiserslautern |
|
29.03.1991 |
|
П |
Desidable Sentences for Context-Free Groups |
1990 |
Madlener K., Otto F. |
|
|
Univ. Kaiserslautern |
|
29.03.1991 |
|
СТ |
A specialized completion procedure for monadic string-rewriting systems presenting groups |
1991 |
Madlener K., Narendran P., Otto F. |
|
|
|
Lecture Notes in Computer Science |
12.09.1991 |
