Pages that link to "Item:Q3474892"
From MaRDI portal
The following pages link to Minimal and complete word unification (Q3474892):
Displayed 14 items.
- Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general (Q673984) (← links)
- Flat matching (Q999086) (← links)
- On the relation between context and sequence unification (Q1034550) (← links)
- Makanin's algorithm is not primitive recursive (Q1127320) (← links)
- Unification problem in equational theories (Q1280985) (← links)
- Word unification and transformation of generalized equations (Q1319389) (← links)
- Unification in partially commutative semigroups (Q1337561) (← links)
- Equations in free semigroups with involution and their relation to equations in free groups. (Q1401304) (← links)
- Solvability of context equations with two context variables is decidable (Q1599536) (← links)
- \(\forall \exists^{5}\)-equational theory of context unification is undecidable (Q1607219) (← links)
- Solving equations with sequence variables and sequence functions (Q2457427) (← links)
- Towards parametrizing word equations (Q4331050) (← links)
- Solving word equations (Q5916475) (← links)
- Codes and equations on trees (Q5941083) (← links)