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):

Displayed 2 items.

• Equational unification, word unification, and 2nd-order equational unification (Q1129255) ‎ (← links)
• A NOTE ON THE EXISTENTIAL THEORY OF EQUATIONS IN PLAIN GROUPS (Q4786308) ‎ (← links)