00000nx a2200000# 45 37476658 19790912aundy0103 zz0 u Madlener, Klaus DNB|109112679 || VIAF Pseudo-natural algorithms for decision problems in certain types of string-rewriting systems 2 DNB Polynomial algorithms for problems in free groups based on Nielsen type arguments 2 DNB On finitely generated non-finite presentations of groups and monoids 2 DNB ˜Eineœ Etini-Einbettung in eine einfache Untergruppe einer endlich dargestellten Gruppe 1 DNB ˜Eine E_1tnn-Frattini-Einbettungœ [En-Frattini-Einbettung] in eine einfache Untergruppe einer endlich dargestellten Gruppe 1 DNB ˜Aœ test for ˜_l63-confluence œ[lambda-confluence] for certain prefix rewriting systems with applications to the generalized word problem 1 DNB ˜Aœ remark on derivations in certain HNN extensions 1 DNB ˜Anœ algorithm for the word problem in HNN extensions and the dependence of its complexity on the group representation 1 DNB Using string rewriting for solving the world problem for finitely presented groups 1 DNB String matching and algorithmic problems in free groups 1 DNB Some undecidability results for finitely generated Thue congruences on a two-letter alphabet 1 DNB Polynomial time algorithms for the Nielsen reduction and related problems in free groups 1 DNB P-complete problems in free groups 1 DNB On weakley confluent monadic string rewriting systems 1 DNB On the quality of pseudo-natural algorithms for the word problem 1 DNB On the problem of generating small convergent systems 1 DNB Groups presented by finite two monadic Church-Rosser Thue systems 1 DNB Finitely generated derivation bounded presentations of groups 1 DNB Encoding complexities in decision problems of finitely presented combinatorial systems 1 DNB Derivation-bounded groups 1 DNB Decidable sentences for context free groups 1 DNB Commutativity in groups presented by finite Church Rosser Thue systems 1 DNB Application of rewriting techniques to solve the generalized word problem in groups 1 DNB Fachbereich Informatik, Univ. 22 DNB GhK 3 DNB GhK, Fachbereich 17 1 DNB DE 26 DNB 197. 2 198. 18 199. 6