The following pages link to Computer Science Logic (Q5394600):
Displaying 10 items.
- Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent (Q407556) (← links)
- Undecidable properties of flat term rewrite systems (Q734041) (← links)
- Non-linear rewrite closure and weak normalization (Q2351264) (← links)
- Undecidable Properties on Length-Two String Rewriting Systems (Q2873677) (← links)
- Non-E-Overlapping, Weakly Shallow, and Non-Collapsing TRSs are Confluent (Q3454085) (← links)
- Unique Normalization for Shallow TRS (Q3636819) (← links)
- Proving Confluence of Term Rewriting Systems Automatically (Q3636821) (← links)
- New Undecidability Results for Properties of Term Rewrite Systems (Q5166638) (← links)
- Closure of Tree Automata Languages under Innermost Rewriting (Q5170159) (← links)
- First-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certification (Q6103588) (← links)
