✦ LIBER ✦
Reachability and confluence are undecidable for flat term rewriting systems
✍ Scribed by Florent Jacquemard
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 99 KB
- Volume
- 87
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
✦ Synopsis
Ground reachability, ground joinability and confluence are shown undecidable for flat term rewriting systems, i.e., systems in which all left and right members of rule have depth at most one.