An Algorithm for the word problem in HNN extensions and the dependence of its complexity on the group representation
Сохранить в:
| Главный автор: | |
|---|---|
| Формат: | |
| Язык: | английский |
| Опубликовано: |
1979
|
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|
| Order eBook: |
|
| Order Book: | Login to order |
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | 1162876 | ||
| 007 | tu | ||
| 041 | |a eng | ||
| 100 | 1 | |a Madlener, K. | |
| 245 | 1 | 0 | |a An Algorithm for the word problem in HNN extensions and the dependence of its complexity on the group representation |
| 246 | 3 | |a MADLENER, K. | |
| 264 | 1 | |c 1979 | |
| 500 | |a MADLENER, K.: -- An Algorithm for the word problem in HNN -- extensions and the dependence of its com- -- plexity on the group representation.1979 -- s.AVENHAUS,J. | ||
| 852 | |c T 20.678/16 | ||
| 999 | |a Verweis |b MADLENER, K. |c AVENHAUS, J. | ||