Reachability and confluence are undecidable for flat term rewriting systems
Abstract
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.
Origin : Files produced by the author(s)
Loading...