The following pages link to (Q2730723):
Displayed 10 items.
- A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite systems (Q613611) (← links)
- The reachability and related decision problems for monadic and semi-constructor TRSs (Q844204) (← links)
- Reachability and confluence are undecidable for flat term rewriting systems (Q1014436) (← links)
- Algorithms and reductions for rewriting problems. II. (Q1853144) (← links)
- Confluence problems for trace rewriting systems (Q1854457) (← links)
- Deciding confluence of certain term rewriting systems in polynomial time (Q1886319) (← links)
- Component-Based Security Policy Design with Colored Petri Nets (Q3184744) (← links)
- (Q4553285) (← links)
- New Undecidability Results for Properties of Term Rewrite Systems (Q5166638) (← links)
- Uniqueness of Normal Forms for Shallow Term Rewrite Systems (Q5278216) (← links)