In this paper, we study the fundamental problem of maintaining a dynamic collection of
strings under the following operations:• make_string–add a string of constant length,• concat …

This paper presents a PSPACE algorithm which yields a finite graph of exponential size that
describes the set of all solutions of equations in free groups as well as the set of all solutions …

We study the computational complexity of existential Presburger arithmetic with (possibly
nested occurrences of) a Kleene-star operator. In addition to being a natural extension of …

Satisfiability of word equations is an important problem in the intersection of formal
languages and algebra: Given two sequences consisting of letters and variables we are to …

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 …

A pattern α α (ie, a string of variables and terminals) matches a word w, if w can be obtained
by uniformly replacing the variables of α α by terminal words. The respective matching …

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 …

This paper explores the nature of the solution sets of systems of equations in virtually
abelian groups. We view this question from two angles. From a formal language perspective …

L systems generalize context-free grammars by incorporating parallel rewriting, and
generate languages such as EDT0L and ET0L that are strictly contained in the class of …

We investigate the class of regular-ordered word equations. In such equations, each
variable occurs at most once in each side and the order of the variables occurring in both …