Pages that link to "Item:Q1886319"

The following pages link to Deciding confluence of certain term rewriting systems in polynomial time (Q1886319):

Displaying 10 items.

• Deciding confluence for a simple class of relational transducer networks (Q269334) (← links)
• A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite systems (Q613611) (← links)
• Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems (Q918215) (← links)
• Normalization properties for shallow TRS and innermost rewriting (Q964737) (← links)
• On deciding confluence of finite string-rewriting systems modulo partial commutativity (Q1262758) (← links)
• Deciding equivalence of separated non-nested attribute systems in polynomial time (Q2289099) (← links)
• (Q3811749) (← links)
• (Q4553285) (← links)
• Uniqueness of Normal Forms for Shallow Term Rewrite Systems (Q5278216) (← links)
• Foundations of Software Science and Computational Structures (Q5705906) (← links)