Add to ORKGWe construct a finite linear finitely terminating rewrite rule system with undecidable theory of one step rewriting
AbstractUsually termination of term rewriting systems (TRS's) is proved by means of a monotonic well...
In abstract algebra, a structure is said to be Noetherian if it does not admit infinite strictly asc...
. In this paper we initiate a study of polynomial-time reductions for some basic decision problems o...
We construct a finite linear finitely terminating rewrite rule system with undecidable theory of one...
AbstractBy reduction from the halting problem for Minsky's two-register machines we prove that there...
By reduction from the halting problem for Minsky's two-register machines we prove that there is...
By reduction from the halting problem for Minsky's two-register machines we prove that there is no a...
AbstractThe theory of one-step rewriting for a given rewrite system R and signature σ is the first-o...
AbstractIt is undecidable whether or not a finite Noetherian term rewriting system is ground-conflue...
AbstractThe undecidability of the termination of rewrite systems is usually proved by reduction to t...
AbstractWe prove three new undecidability results for computational mechanisms over finite trees: Th...
A terminating term rewriting system is called simply terminating if its termination can be shown by ...
Undecidability of various properties of first order term rewriting systems is well-known. An undecid...
Undecidability of various properties of first order term rewriting systems is well-known. An undecid...
This survey describes methods for proving that systems of rewrite rules are terminating programs. We...
AbstractUsually termination of term rewriting systems (TRS's) is proved by means of a monotonic well...
In abstract algebra, a structure is said to be Noetherian if it does not admit infinite strictly asc...
. In this paper we initiate a study of polynomial-time reductions for some basic decision problems o...
We construct a finite linear finitely terminating rewrite rule system with undecidable theory of one...
AbstractBy reduction from the halting problem for Minsky's two-register machines we prove that there...
By reduction from the halting problem for Minsky's two-register machines we prove that there is...
By reduction from the halting problem for Minsky's two-register machines we prove that there is no a...
AbstractThe theory of one-step rewriting for a given rewrite system R and signature σ is the first-o...
AbstractIt is undecidable whether or not a finite Noetherian term rewriting system is ground-conflue...
AbstractThe undecidability of the termination of rewrite systems is usually proved by reduction to t...
AbstractWe prove three new undecidability results for computational mechanisms over finite trees: Th...
A terminating term rewriting system is called simply terminating if its termination can be shown by ...
Undecidability of various properties of first order term rewriting systems is well-known. An undecid...
Undecidability of various properties of first order term rewriting systems is well-known. An undecid...
This survey describes methods for proving that systems of rewrite rules are terminating programs. We...
AbstractUsually termination of term rewriting systems (TRS's) is proved by means of a monotonic well...
In abstract algebra, a structure is said to be Noetherian if it does not admit infinite strictly asc...
. In this paper we initiate a study of polynomial-time reductions for some basic decision problems o...