It is decidable in polynomial time whether a monoid presented by a finite weight reducing and confluent thue system is torsion free.
Saved in:
| Personal Name(s): | Narendran, P. |
|---|---|
| Otto, F. | |
| Imprint: |
Kaiserslautern :
Universität Kaiserslautern,
1987.
|
| Physical Description: |
16 S. |
| Note: |
englisch |
| Series Title: |
Interner Bericht / Universität Kaiserslautern Fachbereich Informatik ;
Vol 0173. |
| Classification: |
| LEADER | 00892cam a2200229 n 4500 | ||
|---|---|---|---|
| 001 | 120351 | ||
| 005 | 19970806000000.0 | ||
| 008 | r1987 | ||
| 035 | |a (Sirsi) a107013 | ||
| 084 | 0 | |a MDF - Formal languages, coding theory |2 ZB | |
| 084 | 0 | |a MFD - Group theory, representation theory |2 ZB | |
| 245 | 0 | 0 | |a It is decidable in polynomial time whether a monoid presented by a finite weight reducing and confluent thue system is torsion free. |
| 260 | |a Kaiserslautern : |b Universität Kaiserslautern, |c 1987. | ||
| 300 | |a 16 S. | ||
| 490 | 0 | |a Interner Bericht / Universität Kaiserslautern Fachbereich Informatik ; |v Vol 0173. | |
| 500 | |a englisch | ||
| 596 | |a 1 | ||
| 700 | 1 | |a Narendran, P. | |
| 700 | 1 | |a Otto, F. | |
| 900 | |a S 005967-0173'01' | ||
| 908 | |a Hochschulschrift | ||
| 949 | |a S 005967-0173'01' |w LC |c 1 |i 1087106212 |l STACKS |m ZB |r Y |s Y |t ZBHS |u 25/3/2009 |x ZB-M |1 PRINT |2 HS | ||