Add to ORKGBy reduction from the halting problem for Minsky's two-register machines we prove that there is no algorithm capable of deciding the 9888-theory of one step rewriting of an arbitrary nite linear conuent nitely terminating term rewriting system (weak undecidability). We also present a xed such system with undecidable -theory of one step rewriting (strong undecidability). This improves over all previously known results of the same kind
This survey describes methods for proving that systems of rewrite rules are terminating programs. We...
AbstractWe claim that the reduction of Post's Correspondence Problem to the decision problem of a th...
Undecidability of various properties of first-order term rewriting systems is well-known. An undecid...
By reduction from the halting problem for Minsky's two-register machines we prove that there is no a...
AbstractBy reduction from the halting problem for Minsky's two-register machines we prove that there...
We construct a finite linear finitely terminating rewrite rule system with undecidable theory of one...
AbstractThe theory of one-step rewriting for a given rewrite system R and signature σ is the first-o...
AbstractThe undecidability of the termination of rewrite systems is usually proved by reduction to t...
Undecidability of various properties of first order term rewriting systems is well-known. An undecid...
A terminating term rewriting system is called simply terminating if its termination can be shown by ...
. In this paper we initiate a study of polynomial-time reductions for some basic decision problems o...
Undecidability of various properties of first order term rewriting systems is well-known. An undecid...
AbstractWe prove three new undecidability results for computational mechanisms over finite trees: Th...
AbstractWe prove that for any Turing machine, there exists a regular (i.e. left-linear and nonoverla...
AbstractUndecidability of various properties of first-order term rewriting systems is well-known. An...
This survey describes methods for proving that systems of rewrite rules are terminating programs. We...
AbstractWe claim that the reduction of Post's Correspondence Problem to the decision problem of a th...
Undecidability of various properties of first-order term rewriting systems is well-known. An undecid...
By reduction from the halting problem for Minsky's two-register machines we prove that there is no a...
AbstractBy reduction from the halting problem for Minsky's two-register machines we prove that there...
We construct a finite linear finitely terminating rewrite rule system with undecidable theory of one...
AbstractThe theory of one-step rewriting for a given rewrite system R and signature σ is the first-o...
AbstractThe undecidability of the termination of rewrite systems is usually proved by reduction to t...
Undecidability of various properties of first order term rewriting systems is well-known. An undecid...
A terminating term rewriting system is called simply terminating if its termination can be shown by ...
. In this paper we initiate a study of polynomial-time reductions for some basic decision problems o...
Undecidability of various properties of first order term rewriting systems is well-known. An undecid...
AbstractWe prove three new undecidability results for computational mechanisms over finite trees: Th...
AbstractWe prove that for any Turing machine, there exists a regular (i.e. left-linear and nonoverla...
AbstractUndecidability of various properties of first-order term rewriting systems is well-known. An...
This survey describes methods for proving that systems of rewrite rules are terminating programs. We...
AbstractWe claim that the reduction of Post's Correspondence Problem to the decision problem of a th...
Undecidability of various properties of first-order term rewriting systems is well-known. An undecid...