Stefan Göller

most citedThe

AC^{0}

-Complexity Of Visibly Pushdown Languages

1 citations · 1 across the 2 of their papers we have counts for

collaborators

2 papers

cs.FL2026

Weak Bisimulation Finiteness of Pushdown Systems With Deterministic $ε$ -Transitions Is 2-ExpTime-Complete

Stefan Göller, Paweł Parys

We consider the problem of deciding whether a given pushdown system all of whose $ε$ -transitions are deterministic is weakly bisimulation finite, that is, whether it is w…

cs.FL2026★ 1 cited

The $AC^{0}$ -Complexity Of Visibly Pushdown Languages

Stefan GÃ¶ller, Stefan Göller, Nathan Grosshans

We study the question of which visibly pushdown languages (VPLs) are in the complexity class $AC^{0}$ and how to effectively decide this question. Our contribution is to int…

Weak Bisimulation Finiteness of Pushdown Systems With Deterministic ε-Transitions Is 2-ExpTime-Complete

The AC0-Complexity Of Visibly Pushdown Languages

Weak Bisimulation Finiteness of Pushdown Systems With Deterministic $ε$ -Transitions Is 2-ExpTime-Complete

The $AC^{0}$ -Complexity Of Visibly Pushdown Languages