Pages that link to "Item:Q5705906"
From MaRDI portal
The following pages link to Foundations of Software Science and Computational Structures (Q5705906):
Displaying 8 items.
- Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems (Q918215) (← links)
- The Church-Rosser property for ground term-rewriting systems is decidable (Q1100890) (← links)
- The unification problem for confluent right-ground term rewriting systems. (Q1401934) (← links)
- Characterizing confluence by rewrite closure and right ground term rewrite systems (Q1885352) (← links)
- Deciding confluence of certain term rewriting systems in polynomial time (Q1886319) (← links)
- (Q3559957) (← links)
- Decidability of confluence and termination of monadic term rewriting systems (Q5055767) (← links)
- Automated Reasoning (Q5307051) (← links)