An algorithm for the word problem in HNN extensions and the dependence of its complexity on the group representation.
Saved in:
| Personal Name(s): | Avenhaus, J. |
|---|---|
| Madlener, K. | |
| Imprint: |
Kaiserslautern :
Universitaet Kaiserslautern,
1979.
|
| Physical Description: |
17 S. |
| Note: |
englisch |
| Series Title: |
Interner Bericht / Universität Kaiserslautern Fachbereich Informatik ;
Vol 0016. |
| Classification: |
| ZB | |
|---|---|
Open Stacks  Call Number: S 005967-0016'01 Barcode: 1087003905
Available
|
|