The characterization of universally quantified visibly pushdown sets in groups
Statement
Let be a group. A set is universally quantified visibly pushdown, written , if it is defined by the corresponding universal visibly pushdown language construction; let denote the class defined analogously from regular languages. The characterization conjecture. In all groups, every set is recognisable. Equivalently, the classes satisfy
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.