Pages that link to "Item:Q4571993"

The following pages link to The word matching problem is undecidable for finite special string-rewriting systems that are confluent (Q4571993):

Displaying 1 item.

• Equational unification, word unification, and 2nd-order equational unification (Q1129255) (← links)