BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260525T035932Z
UID:Seminar-ACTO-494@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Nikhil Mande:MAILTO:Nikhil.Mande@liverpool
DTSTART:20190314T140000
DTEND:20190314T150000
SUMMARY:Algorithms, Complexity Theory and Optimisation Series
DESCRIPTION:Prof. Dirk Nowotka: Word Equations: Theory and Applications\n\nThe investigation of the algorithmic problem of solving equations in free semigroups (word equations)  originated in the attempt to use it as a device to prove the undecidability of Hilbert's 10th problem in the 1960/70s.\nAs it has turned out, however, solving word equations is, although algorithmically demanding, decidable.\nThis problem has developed into a research area of its own with quite some progress and yet still very interesting open questions.   Adding to that interest is the fact that this very theoretical research has started to make quite some impact on the practical  field of software verification. Namely, so called string solvers are increasingly used in analysing software for security aspects. \nHere, the existential theory of word equations is enriched with predicates like length and rational constraints.\n\nIn my talk I will give an overview of how the area of word equations has developed, I will introduce some recent results and sketch out the current state of the art, mention open problems, and draw the connection to practical applications.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=494
LOCATION:
END:VEVENT
END:VCALENDAR