Pages that link to "Item:Q6488537"
From MaRDI portal
The following pages link to Some results on equational unification (Q6488537):
Displaying 6 items.
- Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general (Q673984) (← links)
- Equational unification, word unification, and 2nd-order equational unification (Q1129255) (← links)
- The word matching problem is undecidable for finite special string-rewriting systems that are confluent (Q4571993) (← links)
- Some independence results for equational unification (Q5055843) (← links)
- (Q5090942) (← links)
- Unification theory (Q6169561) (← links)
