Abstract not found

Following the course set by A. Markov (1951), S. Adjan (1958), and M. Rabin (1958), C. ' O'D'unlaing (1983) has shown that certain properties of finitely generated Thue congruences are undecidable in general. Here we prove that many of these undecidability results remain valid even when only finitely generated Thue congruences on a fixed twoletter alphabet \Sigma 2 are considered. In contrast to a construction given by P. Schupp (1976) which applies to groups only, we use a modified version of a technical lemma from A. Markov's original paper. Based on this technical result we can carry the result of A. Sattler-Klein (1996), which says that certain Markov properties remain undecidable even when they are restricted to finitely generated Thue congruences that are decidable, over to the alphabet \Sigma 2 . 1 Introduction A string-rewriting system R on some alphabet \Sigma is a set of pairs of strings over \Sigma. It induces a congruence $ R on \Sigma , the Thue congruence generat...

containing the preceding one, related to codimension 2 smooth embeddings of manifolds. Kn is the class of groups of complements of n-spheres in S n+2; S (resp. M, G) is the class of groups of complements of orientable, closed surfaces in S 4 (resp. a 1-connected 4-manifold,