Pages that link to "Item:Q1100890"

The following pages link to The Church-Rosser property for ground term-rewriting systems is decidable (Q1100890):

Displaying 17 items.

• Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems (Q918215) (← links)
• Reachability and confluence are undecidable for flat term rewriting systems (Q1014436) (← links)
• Intersection of finitely generated congruences over term algebra (Q1399965) (← links)
• Term rewriting restricted to ground terms. (Q1401322) (← links)
• On ground tree transformations and congruences induced by tree automata. (Q1401416) (← links)
• Restricted ground tree transducers (Q1589437) (← links)
• Derivation trees of ground term rewriting systems. (Q1854289) (← links)
• Deciding confluence of certain term rewriting systems in polynomial time (Q1886319) (← links)
• Undecidable Properties on Length-Two String Rewriting Systems (Q2873677) (← links)
• The $\Pi^0_2$ -Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity) (Q3636833) (← links)
• Efficient ground completion (Q5055736) (← links)
• Decidability of confluence and termination of monadic term rewriting systems (Q5055767) (← links)
• Open problems in rewriting (Q5055780) (← links)
• More problems in rewriting (Q5055812) (← links)
• Problems in rewriting III (Q5055847) (← links)
• Equality and disequality constraints on direct subterms in tree automata (Q5096779) (← links)
• New Undecidability Results for Properties of Term Rewrite Systems (Q5166638) (← links)