An algorithm classifies visibly pushdown languages as AC^0, ACC^0-hard, or constant-depth equivalent to unions of newly defined intermediate VPLs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The $\mathsf{AC}^0$-Complexity Of Visibly Pushdown Languages
An algorithm classifies visibly pushdown languages as AC^0, ACC^0-hard, or constant-depth equivalent to unions of newly defined intermediate VPLs.