Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6874200 | Information Processing Letters | 2018 | 5 Pages |
Abstract
We show that it is undecidable whether the intersection of the reflexive transitive closures of two rewrite relations induced by term rewriting systems is equal to the reflexive transitive closure of a rewrite relation induced by a term rewriting system.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Sándor Vágvölgyi,