Pages that link to "Item:Q673984"
From MaRDI portal
The following pages link to Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general (Q673984):
Displaying 4 items.
- Equational unification, word unification, and 2nd-order equational unification (Q1129255) (← links)
- The word problem for one-relation monoids: a survey (Q1982573) (← 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)