Pages that link to "Item:Q1319389"
From MaRDI portal
The following pages link to Word unification and transformation of generalized equations (Q1319389):
Displaying 16 items.
- Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general (Q673984) (← links)
- Flat matching (Q999086) (← links)
- Makanin's algorithm is not primitive recursive (Q1127320) (← 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)
- Decidability of bounded higher-order unification (Q2456577) (← links)
- Solving equations with sequence variables and sequence functions (Q2457427) (← links)
- Pattern Unification with Sequence Variables and Flexible Arity Symbols (Q2842594) (← links)
- What Is Essential Unification? (Q3305325) (← links)
- The word matching problem is undecidable for finite special string-rewriting systems that are confluent (Q4571993) (← links)
- Graph unification and matching (Q4645268) (← links)
- An algorithm for distributive unification (Q5055867) (← links)
- (Q5092406) (← links)
- The hardness of solving simple word equations (Q5111232) (← links)
- On equality up-to constraints over finite trees, context unification, and one-step rewriting (Q5234685) (← links)
