Daniel
Turaev
Berlin
Visibly Pushdown Languages in Groups
Abstract.
The class VPL of Visibly Pushdown Languages is of interest in computer science due to its low complexity membership problem, rich closure properties akin to regular languages, and expressive power very closely linked to the set of all context-free languages. In recent years, VPL has been studied as a class of constraints on solution sets to equations in the free monoid. In this context, it was shown that the problem of solving word equations with VPL constraints is undecidable. This naturally raises analogous questions in the case of free groups, where word equations with rational constraints are known to be decidable, but other language constraints (including VPL) have not yet been considered. Namely, defining visibly pushdown languages in any given group is not a trivial task -- there are several important ways to encode language classes in a group. In this talk we will discuss these distinct ways to define visibly pushdown languages in groups, focusing on the free group. After presenting some results on the structure of these VPL classes, we will see that that solving word equations with VPL constraints as reduced words is undecidable, mirroring the free monoid case. However, other ways of defining VPL sets exist, and yield several interesting open questions that may yet turn out decidable.