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

Сохранить в:
Библиографические подробности
Главный автор: Madlener, Klaus
Другие авторы: Otto, Friedrich
Формат:
Язык:английский
Опубликовано: Kaiserslautern 1983
Серии:Interner Bericht. Fachbereich Informatik. Universität Kaiserslautern 90
Метки: Добавить метку
Нет меток, Требуется 1-ая метка записи!
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 по Madlener, Klaus

Опубликовано 1983
Search Result 4

On the Quality of pseudo-natural algorithms for the word problem по Otto, Friedrich

Опубликовано 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