Pages that link to "Item:Q2237894"
From MaRDI portal
The following pages link to Word equations in non-deterministic linear space (Q2237894):
Displaying 13 items.
- Recompression: technique for word equations and compressed data (Q782556) (← links)
- Equations in words: An algorithmic contribution (Q1326954) (← links)
- Word equations in the context of string solving (Q2163975) (← links)
- On PSPACE generation of a solution set of a word equation and its applications (Q2326385) (← links)
- The non-parametrizability of the word equation \(xyz=zvx\): a short proof (Q2575750) (← links)
- One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations (Q2817399) (← links)
- Satisfiability of word equations with constants is in NEXPTIME (Q2819601) (← links)
- Non-deterministic linear hypersubstitutions (Q5136370) (← links)
- Quadratic word equations with length constraints, counter systems, and Presburger arithmetic with divisibility (Q6109598) (← links)
- On the Solution Sets of Entire Systems of Word Equations (Q6134879) (← links)
- Makanin's algorithm for word equations-two improvements and a generalization (Q6169560) (← links)
- A closer look at the expressive power of logics based on word equations (Q6580075) (← links)
- On the solution sets of three-variable word equations (Q6661760) (← links)
