Pages that link to "Item:Q3583578"
From MaRDI portal
The following pages link to Satisfiability of word equations with constants is in PSPACE (Q3583578):
Displayed 16 items.
- On the complexity of decidable cases of the commutation problem of languages (Q557812) (← links)
- \(\forall \exists^{5}\)-equational theory of context unification is undecidable (Q1607219) (← links)
- The complexity of compressed membership problems for finite automata (Q2254509) (← links)
- On systems of word equations over three unknowns with at most six occurrences of one of the unknowns (Q2271428) (← links)
- On maximal chains of systems of word equations (Q2510762) (← links)
- The existential theory of equations with rational constraints in free groups is PSPACE-complete (Q2573633) (← links)
- The non-parametrizability of the word equation \(xyz=zvx\): a short proof (Q2575750) (← links)
- Equations in the Partial Semigroup of Words with Overlapping Products (Q3166946) (← links)
- SOLVABILITY OF EQUATIONS IN GRAPH GROUPS IS DECIDABLE (Q3430310) (← links)
- ON NON-PERIODIC SOLUTIONS OF INDEPENDENT SYSTEMS OF WORD EQUATIONS OVER THREE UNKNOWNS (Q3503102) (← links)
- WORD EQUATIONS OVER GRAPH PRODUCTS (Q3521473) (← links)
- An Analysis and a Reproof of Hmelevskii’s Theorem (Q3533033) (← links)
- Towards Decidability of Conjugacy of Pairs and Triples (Q3601812) (← links)
- Solving one-variable equations in free groups (Q3619537) (← links)
- On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations (Q3637246) (← links)
- POLYNOMIAL-TIME COMPLEXITY FOR INSTANCES OF THE ENDOMORPHISM PROBLEM IN FREE GROUPS (Q5297787) (← links)