pith. sign in

On the Expressive Power of String Constraints

2 Pith papers cite this work, alongside 7 external citations. Polarity classification is still indexing.

2 Pith papers citing it
7 external citations · Crossref

years

2026 2

verdicts

UNVERDICTED 2

representative citing papers

Visibly Pushdown Languages in Groups

math.GR · 2026-04-24 · unverdicted · novelty 7.0

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.

citing papers explorer

Showing 2 of 2 citing papers.

  • String Solving with Stabilization and Transducers (Technical Report) cs.FL · 2026-05-14 · unverdicted · none · ref 26

    Generalization of Z3-Noodler's stabilization method to transducers enables efficient solving of relational string constraints and outperforms prior solvers by solving more instances orders of magnitude faster.

  • Visibly Pushdown Languages in Groups math.GR · 2026-04-24 · unverdicted · none · ref 15

    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.