![](/img/cover-not-exists.png)
Reachability and confluence are undecidable for flat term rewriting systems
Florent JacquemardVolume:
87
Year:
2003
Language:
english
Pages:
6
DOI:
10.1016/s0020-0190(03)00310-7
File:
PDF, 99 KB
english, 2003