Word equations, constraints and string solvers
- 👤 Speaker: Laura Ciobanu Radomirovic (Technische Universität Berlin)
- 📅 Date & Time: Wednesday 23 July 2025, 11:00 - 12:00
- 📍 Venue: External
Abstract
In this talk I will give an overview of word equations in free monoids and groups that are `free-like’. I will then discuss how one can express the solutions to word equations as formal languages, and touch upon the (un)decidability of solving word equations with a variety of algebraic and combinatorial constraints. The constraints stem from both theoretical and practical settings, the latter coming from the world of string solvers. If time allows, I will mention recent efforts to solve word equations with reinforcement learning and SMT solvers. This is based on work with V. Diekert and M. Elder, separately with G. Zetzsche, and with/of Albert Garreta.
Series This talk is part of the Isaac Newton Institute Seminar Series series.
Included in Lists
- All CMS events
- bld31
- dh539
- External
- Featured lists
- INI info aggregator
- Isaac Newton Institute Seminar Series
- School of Physical Sciences
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)

Laura Ciobanu Radomirovic (Technische Universität Berlin)
Wednesday 23 July 2025, 11:00-12:00