Widespread use of string solvers in the formal analysis of string-heavy programs has led to a
growing demand for more efficient and reliable techniques which can be applied in this …

The study of word equations is a central topic in mathematics and theoretical computer
science. Recently, the question of whether a given word equation, augmented with various …

We present Woorpje, a string solver for bounded word equations (ie, equations where the
length of each variable is upper bounded by a given integer). Our algorithm works by …

We investigate properties of strings which are expressible by canonical types of string
constraints. Specifically, we consider a landscape of 20 logical theories, whose syntax is …

We show that the full set of solutions to systems of equations and inequations in a hyperbolic
group, as shortlex geodesic words (or any regular set of quasigeodesic normal forms), is an …

In this note, we overview a series of results that were obtained in [16, 15]. In these papers,
we have investigated the properties of formal languages ex-pressible in terms of formulas …

Widespread use of string solvers in formal analysis of string-heavy programs has led to a
growing demand for more efficient and reliable techniques which can be applied in this …

We show that the full set of solutions to systems of equations and inequations in a hyperbolic
group, with or without torsion, as shortlex geodesic words, is an EDT0L language whose …

Combinatorics on Words is a rather young domain encompassing the study of words and
formal languages. An archetypal example of a task in Combinatorics on Words is to solve …

It is well known that the problem solving equations in virtually free groups can be reduced to
the problem of solving twisted word equations with regular constraints over free monoids …