Pages that link to "Item:Q1014436"
From MaRDI portal
The following pages link to Reachability and confluence are undecidable for flat term rewriting systems (Q1014436):
Displaying 8 items.
- Levels of undecidability in rewriting (Q627134) (← links)
- Undecidable properties of flat term rewrite systems (Q734041) (← links)
- The reachability and related decision problems for monadic and semi-constructor TRSs (Q844204) (← links)
- Deciding confluence of certain term rewriting systems in polynomial time (Q1886319) (← links)
- Some decidability results on one-pass reductions (Q2423761) (← links)
- Undecidable Properties on Length-Two String Rewriting Systems (Q2873677) (← links)
- Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems (Q3522018) (← links)
- Unique Normalization for Shallow TRS (Q3636819) (← links)
