Pages that link to "Item:Q2819601"
From MaRDI portal
The following pages link to Satisfiability of word equations with constants is in NEXPTIME (Q2819601):
Displaying 19 items.
- One-variable word equations in linear time (Q261339) (← links)
- Finding all solutions of equations in free groups and monoids with involution (Q342722) (← links)
- On word equations in one variable (Q547296) (← links)
- Simplifying the signature in second-order unification (Q843951) (← links)
- Equations in free semigroups with involution and their relation to equations in free groups. (Q1401304) (← links)
- Decidability of bounded second order unification (Q1887168) (← links)
- Word equations in the context of string solving (Q2163975) (← links)
- Word equations in non-deterministic linear space (Q2237894) (← links)
- On systems of word equations over three unknowns with at most six occurrences of one of the unknowns (Q2271428) (← links)
- On PSPACE generation of a solution set of a word equation and its applications (Q2326385) (← links)
- Equations over free inverse monoids with idempotent variables (Q2411041) (← 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)
- More Than 1700 Years of Word Equations (Q2947143) (← links)
- On systems of equations over free partially commutative groups (Q3091752) (← links)
- On Conjugacy of Languages (Q3147021) (← links)
- Equations on partial words (Q3549287) (← links)
- Matching Trace Patterns with Regular Policies (Q3618572) (← links)
- (Q5092406) (← links)
