Word equations, constraints and string solvers

Add to your list(s) Download to your calendar using vCal

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

If you have a question about this talk, please contact nobody.

OGGW05 - Geometric and combinatorial methods in the foundations of computer science and artificial intelligence

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. 

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

• All CMS events
• External
• Featured lists
• INI info aggregator
• Isaac Newton Institute Seminar Series
• School of Physical Sciences
• bld31
• dh539

Note that ex-directory lists are not shown.