|
1 |
For groups the property of having finite derivation type is equivalent to the homological finiteness condition FP3
Cremanns, Robert. - Kassel : GhK, 1994
|
|
|
|
2 |
Solvability of word equations modulo finite special and confluent string rewriting systems is undecidable in general
Otto, Friedrich. - Kassel : GhK, 1994
|
|
|
|
3 |
Some decision problems related to the regularity of monoids
Otto, Friedrich. - Kassel : GhK, 1994
|
|
|
|
4 |
Finite derivation type implies the homological finiteness condition FP3
Cremanns, Robert. - Kassel : GhK, 1993
|
|
|
|
5 |
String rewriting systems
Book, Ronald V.. - New York : Springer, 1993
|
|
|
|
6 |
The language of final stack contents of a pushdown automaton is effectively regular
Cremanns, Robert. - Kassel : GhK, 1993
|
|
|
|
7 |
For group presentations Squier's finiteness condition implies the homological finiteness condition FP3
Otto, Friedrich. - Kassel : GhK, 1992
|
|
|
|
8 |
On the problem of generating small convergent systems
Madlener, Klaus. - Kassel : GhK, 1992
|
|
|
|
9 |
Codes modulo finite, monadic and confluent thue systems
Narendran, Paliath. - Kassel : GhK, 1991
|
|
|
|
10 |
On confluence versus strong confluence for one-rule trace rewriting systems
Otto, Friedrich. - Kassel : GhK, 1991
|
|
Administration
