✦ LIBER ✦
Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general
✍ Scribed by Friedrich Otto
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 512 KB
- Volume
- 53
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.