Pages that link to "Item:Q1199548"
From MaRDI portal
The following pages link to Simulation of Turing machines by a regular rewrite rule (Q1199548):
Displayed 14 items.
- Weighted graphs: A tool for studying the halting problem and time complexity in term rewriting systems and logic programming (Q915431) (← links)
- On termination of one rule rewrite systems (Q1334676) (← links)
- Simple termination is difficult (Q1343111) (← links)
- Simple termination of rewrite systems (Q1392146) (← links)
- Higher order unification via explicit substitutions (Q1854337) (← links)
- Relative undecidability in term rewriting. I: The termination hierarchy (Q1854559) (← links)
- Relative undecidability in term rewriting. II: The confluence hierarchy (Q1854560) (← links)
- An improved general path order (Q1925013) (← links)
- On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting (Q2502172) (← links)
- Undecidable Properties on Length-Two String Rewriting Systems (Q2873677) (← links)
- A Confluent Rewriting System Having No Computable, One-Step, Normalizing Strategy (Q2946765) (← links)
- Simple termination is difficult (Q5055798) (← links)
- Problems in rewriting III (Q5055847) (← links)
- Polynomials over the reals in proofs of termination : from theory to practice (Q5313720) (← links)