Pages that link to "Item:Q2730723"
From MaRDI portal
The following pages link to Algorithms and reductions for rewriting problems (Q2730723):
Displaying 19 items.
- Transformation of algorithms written in the form of composition schemes (Q466022) (← links)
- A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite systems (Q613611) (← links)
- A fast algorithm for generating reduced ground rewriting systems from a set of ground equations (Q689111) (← 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)
- Systems of reductions (Q1098283) (← links)
- Computing circumscription revisited: A reduction algorithm (Q1367072) (← links)
- Reduction algorithms for solving large systems of logical equations (Q1594832) (← 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)
- Reducing the gradedness problem of string rewriting systems to a termination problem (Q3465631) (← links)
- (Q4004329) (← links)
- (Q4553285) (← links)
- The word matching problem is undecidable for finite special string-rewriting systems that are confluent (Q4571993) (← links)
- New Undecidability Results for Properties of Term Rewrite Systems (Q5166638) (← links)
- Uniqueness of Normal Forms for Shallow Term Rewrite Systems (Q5278216) (← links)
- On Reduct Construction Algorithms (Q5757967) (← links)
