On Solving String Equations via Powers and Parikh Images
Logic in Computer Science
2026-03-06 v1
Abstract
We present a new approach for solving string equations as extensions of Nielsen transformations. Key to our work are the combination of three techniques: a power operator for strings; generalisations of Parikh images; and equality decomposition. Using these methods allows us to solve complex string equations, including less commonly encountered SMT inputs over strings.
Cite
@article{arxiv.2603.05273,
title = {On Solving String Equations via Powers and Parikh Images},
author = {Clemens Eisenhofer and Theodor Seiser and Nikolaj S. Bjørner and Laura Kovács},
journal= {arXiv preprint arXiv:2603.05273},
year = {2026}
}