On the confluence of linear shallow term rewrite systems
From MaRDI portal
Recommendations
- Computer Science Logic
- Deciding confluence of certain term rewriting systems in polynomial time
- Classes of term rewrite systems with polynomial confluence problems
- Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
- Shallow confluence of conditional term rewriting systems
Cited in
(20)- Reachability and confluence are undecidable for flat term rewriting systems
- Deciding confluence of certain term rewriting systems in polynomial time
- Shallow confluence of conditional term rewriting systems
- Undecidable properties on length-two string rewriting systems
- Rational term rewriting revisited: decidability and confluence
- Non-E-overlapping, weakly shallow, and non-collapsing TRSs are confluent
- scientific article; zbMATH DE number 1508936 (Why is no real title available?)
- Deciding confluence and normal form properties of ground term rewrite systems efficiently
- scientific article; zbMATH DE number 6819785 (Why is no real title available?)
- Deciding confluence of ground term rewrite systems in cubic time
- Classes of term rewrite systems with polynomial confluence problems
- Uniqueness of normal forms for shallow term rewrite systems
- Computer Science Logic
- Automated Deduction – CADE-20
- Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems
- A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite systems
- Undecidable properties of flat term rewrite systems
- Bottom-up rewriting for words and terms
- On ground-confluence of term rewriting systems
- Normalization properties for shallow TRS and innermost rewriting
This page was built for publication: On the confluence of linear shallow term rewrite systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418639)
