The word problem of a finitely generated group is visibly pushdown if and only if the group is finite, free reduction does not preserve VPL, equation solving with VPL constraints is undecidable in free groups, and sets with VPL preimages are often recognizable.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.GR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Visibly Pushdown Languages in Groups
The word problem of a finitely generated group is visibly pushdown if and only if the group is finite, free reduction does not preserve VPL, equation solving with VPL constraints is undecidable in free groups, and sets with VPL preimages are often recognizable.