The following pages link to Complexity of Makanin's algorithm (Q4371685):
Displaying 24 items.
- Finding all solutions of equations in free groups and monoids with involution (Q342722) (← links)
- On word equations in one variable (Q547296) (← links)
- Extending free pregroups with lower bounds (Q993496) (← links)
- On the relation between context and sequence unification (Q1034550) (← links)
- Makanin's algorithm is not primitive recursive (Q1127320) (← links)
- Unification in commutative semigroups (Q1383954) (← 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)
- Monadic simultaneous rigid \(E\)-unification (Q1960540) (← links)
- Word equations in non-deterministic linear space (Q2237894) (← links)
- On PSPACE generation of a solution set of a word equation and its applications (Q2326385) (← links)
- On the complexity of computation maximal exponent of periodicity of word equations and expressible relations (note) (Q2326386) (← links)
- Decidability of bounded higher-order unification (Q2456577) (← links)
- The existential theory of equations with rational constraints in free groups is PSPACE-complete (Q2573633) (← links)
- Two-variable word equations (Q2729626) (← links)
- More Than 1700 Years of Word Equations (Q2947143) (← links)
- Towards Decidability of Conjugacy of Pairs and Triples (Q3601812) (← links)
- The expressibility of languages and relations by word equations (Q4571943) (← links)
- Monadic simultaneous rigid E-unification and related problems (Q4571948) (← links)
- EXPONENT OF PERIODICITY OF WORD EQUATIONS IN FIXED DIMENSION IS POLYNOMIAL (Q4786337) (← links)
- Efficient solving of the word equations in one variable (Q5096891) (← 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)
