On finitely generated non-finite Presentations of groups and monoids

-д хадгалсан:
Номзүйн дэлгэрэнгүй
Үндсэн зохиолч: Madlener, Klaus
Бусад зохиолчид: Otto, Friedrich
Формат: Ном
Хэл сонгох:англи
Хэвлэсэн: Kaiserslautern 1983
Цуврал:Interner Bericht. Fachbereich Informatik. Universität Kaiserslautern 91
Шошгууд: Шошго нэмэх
Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!
Order eBook:
Order Book: Login to order
Search Result 1

Groups presented by finite two-monadic Church-Rosser Thue systems Madlener, Klaus

Хэвлэсэн 1984
Ном
Search Result 2

Pseudo natural Algorithms for decision problems in certain types of string-rewriting systems. Madlener, Klaus

Хэвлэсэн 1984
Ном
Search Result 3

On finitely generated non-finite Presentations of groups and monoids Otto, Friedrich

Хэвлэсэн 1983
Ном
Search Result 4

On the Quality of pseudo-natural algorithms for the word problem. Madlener, Klaus

Хэвлэсэн 1983
Ном
Search Result 5

Encoding complexities in decision problems of finitely presented combinatorial systems. Madlener, Klaus

Хэвлэсэн 1982
Ном
Search Result 6

Finitely generated derivation bounded Presentation of groups Madlener, Klaus

Хэвлэсэн 1982
Ном
Search Result 7

Derivation-bounded Groups Madlener, Klaus

Хэвлэсэн 1981
Ном
Search Result 8

Eine E-Frattini-Einbettung in eine einfach Untergruppe einer endlich dargestellten Gruppe Madlener, Klaus

Хэвлэсэн 1980
Ном
Search Result 9

String Matching and algorithmic problems in free groups Madlener, Klaus

Хэвлэсэн 1979
Ном
Search Result 10

P-complete Problems in free groups Madlener, Klaus

Ном
Search Result 11

Polynomial Time-Algorithms for the Nielsen reduction and related problems in free groups Madlener, Klaus

Ном