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.
In: Automata, languages and programming, Lecture Notes in Comput
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Visibly recursive automata extend procedural automata and use codeterminism to achieve efficient complementation and other desirable algorithmic properties.
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.
-
Visibly Recursive Automata
Visibly recursive automata extend procedural automata and use codeterminism to achieve efficient complementation and other desirable algorithmic properties.