Recommendations
- Undecidable properties of flat term rewrite systems
- Reachability and confluence are undecidable for flat term rewriting systems
- Deciding the confluence of ordered term rewrite systems
- The reachability and related decision problems for monadic and semi-constructor TRSs
- Classes of term rewrite systems with polynomial confluence problems
Cited in
(15)- Reachability and confluence are undecidable for flat term rewriting systems
- Conditions for confluence of innermost terminating term rewriting systems
- Undecidable properties on length-two string rewriting systems
- Non-E-overlapping, weakly shallow, and non-collapsing TRSs are confluent
- Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems
- Unique Normalization for Shallow TRS
- Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent
- New Undecidability Results for Properties of Term Rewrite Systems
- Closure of tree automata languages under innermost rewriting
- Uniqueness of normal forms for shallow term rewrite systems
- Rewriting Techniques and Applications
- A fast decision procedure for uniqueness of normal forms w.r.t. conversion of shallow term rewriting systems
- Tail reduction free term rewriting systems revisited
- Undecidable properties of flat term rewrite systems
- The reachability and related decision problems for monadic and semi-constructor TRSs
This page was built for publication: The Confluence Problem for Flat TRSs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5302902)
