P-complete Problems in free groups

Enregistré dans:

Détails bibliographiques
Auteur principal:	Madlener, Klaus
Format:	Livre
Langue:	anglais
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!
Order eBook:
Order Book:	Login to order

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

Publié 1984

Livre

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

Publié 1984

matching Alma AC00562001 (author 100.0%, title 100.0%, shelfmark 90.9%, overall 98.2%)

Livre

On finitely generated non-finite Presentations of groups and monoids par Madlener, Klaus

Publié 1983

matching Alma AC00105979 (author 100.0%, title 100.0%, shelfmark 90.0%, overall 98.0%)

Livre

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

Publié 1983

matching Alma AC00550334 (author 100.0%, title 100.0%, shelfmark 90.0%, overall 98.0%)

Livre

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

Publié 1982

matching Alma AC00560555 (author 100.0%, title 100.0%, shelfmark 90.0%, overall 98.0%)

Livre

Finitely generated derivation bounded Presentation of groups par Madlener, Klaus

Publié 1982

Livre

Derivation-bounded Groups par Madlener, Klaus

Publié 1981

matching Alma AC00560789 (author 100.0%, title 100.0%, shelfmark 90.0%, overall 98.0%)
matching Alma AC00560715 (author 100.0%, title 58.1%, shelfmark 80.0%, overall 77.2%)

Livre

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

Publié 1980

Livre

P-complete Problems in free groups par Avenhaus, Juergen

Publié 1980

matching Alma AC00560679 (author 96.8%, title 100.0%, shelfmark 90.0%, overall 96.9%)

Livre

String Matching and algorithmic problems in free groups par Madlener, Klaus

Publié 1979

Livre

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

Livre

P-complete Problems in free groups

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

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

On finitely generated non-finite Presentations of groups and monoids par Madlener, Klaus

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

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

Finitely generated derivation bounded Presentation of groups par Madlener, Klaus

Derivation-bounded Groups par Madlener, Klaus

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

P-complete Problems in free groups par Avenhaus, Juergen

String Matching and algorithmic problems in free groups par Madlener, Klaus

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

Documents similaires