We prove connections between one-variable word equations and three-variable constant-
free word equations, and use them to prove that the number of equations in an independent …

We solve two long-standing open problems on word equations. Firstly, we prove that a one-
variable word equation with constants has either at most three or an infinite number of …

String solvers are tools for automatically reasoning about words over some finite alphabet.
They are commonly used to perform analyses of string manipulating programs. A …

We solve two long-standing open problems on word equations. Firstly, we prove that a one-
variable word equation with constants has either at most three or an infinite number of …

We solve two long-standing open problems on word equations. Firstly, we prove that a one-
variable word equation with constants has either at most three or an infinite number of …

A system of equations is called independent if it is not equivalent to any of its proper
subsystems. We consider the following decades-old question: If we fix the number of …

We prove connections between one-unknown word equations and three-unknown constant-
free word equations, and use them to prove that the number of equations in an independent …

We discuss two well-known questions on word equations, two methods for analyzing them,
and the possible connections between these topics. The first question we are interested in …