Pages that link to "Item:Q5055873"
From MaRDI portal
The following pages link to Decidable approximations of term rewriting systems (Q5055873):
Displaying 20 items.
- Root-neededness and approximations of neededness (Q293367) (← links)
- Levels of undecidability in rewriting (Q627134) (← links)
- Termination criteria for tree automata completion (Q730470) (← links)
- Bottom-up rewriting for words and terms (Q741256) (← links)
- A theoretical limit for safety verification techniques with regular fix-point computations (Q963463) (← links)
- Murg term rewrite systems (Q975468) (← links)
- Strong and NV-sequentiality of constructor systems (Q1029079) (← links)
- Decidable call-by-need computations in term rewriting (Q1763429) (← links)
- Derivation trees of ground term rewriting systems. (Q1854289) (← links)
- The combinator S (Q1854346) (← links)
- Some decidability results on one-pass reductions (Q2423761) (← links)
- Tree automata for rewrite strategies (Q2456572) (← links)
- Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems (Q3522018) (← links)
- Handling Left-Quadratic Rules When Completing Tree Automata (Q4982086) (← links)
- (Q4993342) (← links)
- Closure of Tree Automata Languages under Innermost Rewriting (Q5170159) (← links)
- Decidable call by need computations in term rewriting (extended abstract) (Q5234682) (← links)
- Soft typing for ordered resolution (Q5234715) (← links)
- On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings (Q5240136) (← links)
- Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting (Q6052950) (← links)
