ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a group. A set is universally quantified visibly pushdown, written 4VPL∀44\mathbf{VPL}^\forall4, if it is defined by the corresponding universal visibly pushdown language construction; let 4REG∀44\mathbf{REG}^\forall4 denote the class defined analogously from regular languages. The characterization conjecture. In all groups, every 4VPL∀44\mathbf{VPL}^\forall4 set is recognisable. Equivalently, the classes satisfy

VPL∀=REG∀.\mathbf{VPL}^\forall=\mathbf{REG}^\forall.

This would identify the universally quantified visibly pushdown sets with the recognisable sets and clarify the structure of visibly pushdown constraints over arbitrary groups. The paper states that it makes significant progress towards this claim, but provides no resolution.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.