The following pages link to Simple termination is difficult (Q1343111):
Displaying 20 items.
- Levels of undecidability in rewriting (Q627134) (← links)
- Summarization for termination: No return! (Q845247) (← links)
- Proving termination of context-sensitive rewriting by transformation (Q859833) (← links)
- The undecidability of self-embedding for term rewriting systems (Q1061484) (← links)
- Termination of rewriting (Q1098624) (← links)
- Simulation of Turing machines by a regular rewrite rule (Q1199548) (← links)
- On termination of one rule rewrite systems (Q1334676) (← links)
- On the modularity of termination of term rewriting systems (Q1349693) (← links)
- Omega-termination is undecidable for totally terminating term rewriting systems (Q1355781) (← links)
- Simple termination of rewrite systems (Q1392146) (← links)
- Invariants, patterns and weights for ordering terms (Q1581131) (← links)
- Computability of affine non-conditional recurrent systems (Q1606914) (← links)
- Relative undecidability in term rewriting. I: The termination hierarchy (Q1854559) (← links)
- Relative undecidability in term rewriting. II: The confluence hierarchy (Q1854560) (← links)
- Decidability of innermost termination and context-sensitive termination for semi-constructor term rewriting systems (Q2873675) (← links)
- Order-sorted Homeomorphic Embedding Modulo Combinations of Associativity and/or Commutativity Axioms* (Q4988927) (← links)
- Simulation of Turing machines by a left-linear rewrite rule (Q5055715) (← links)
- Simple termination is difficult (Q5055798) (← links)
- Problems in rewriting III (Q5055847) (← links)
- NEW RESULTS ON COMPUTABILITY OF RECURRENCE EQUATIONS (Q5248978) (← links)
