Pages that link to "Item:Q1400714"
From MaRDI portal
The following pages link to Decidability for left-linear growing term rewriting systems. (Q1400714):
Displaying 22 items.
- Levels of undecidability in rewriting (Q627134) (← links)
- Undecidable properties of flat term rewrite systems (Q734041) (← links)
- Bottom-up rewriting for words and terms (Q741256) (← links)
- On tree automata that certify termination of left-linear term rewriting systems (Q876043) (← links)
- Normalization properties for shallow TRS and innermost rewriting (Q964737) (← links)
- Match-bounds revisited (Q1041044) (← links)
- Linearizing term rewriting systems using test sets (Q1332338) (← links)
- A property of left-linear rewrite systems preserving recognizability (Q1575563) (← links)
- Decidable call-by-need computations in term rewriting (Q1763429) (← links)
- Modularity in term rewriting revisited (Q1929227) (← links)
- Non-linear rewrite closure and weak normalization (Q2351264) (← links)
- Some undecidable approximations of TRSs (Q2849583) (← links)
- Decidability of innermost termination and context-sensitive termination for semi-constructor term rewriting systems (Q2873675) (← links)
- Controlled Term Rewriting (Q3172893) (← links)
- Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies (Q3454088) (← links)
- Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems (Q3540124) (← links)
- Unique Normalization for Shallow TRS (Q3636819) (← links)
- Decidable approximations of term rewriting systems (Q5055873) (← links)
- Formalized Proofs of the Infinity and Normal Form Predicates in the First-Order Theory of Rewriting (Q5164173) (← links)
- New Undecidability Results for Properties of Term Rewrite Systems (Q5166638) (← links)
- Beyond Dependency Graphs (Q5191112) (← links)
- First-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certification (Q6103588) (← links)
