An algorithm classifies visibly pushdown languages as AC^0, ACC^0-hard, or constant-depth equivalent to unions of newly defined intermediate VPLs.
Pebbling Moutain Ranges and its Applica tion of DCFL-Recognition
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.FL 2years
2023 2verdicts
UNVERDICTED 2representative citing papers
A survey highlighting known results on descriptional complexity of finite automata, noting non-recursive trade-offs and uncomputability of state complexity for certain combined regularity-preserving operations.
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.
-
Descriptional Complexity of Finite Automata -- Selected Highlights
A survey highlighting known results on descriptional complexity of finite automata, noting non-recursive trade-offs and uncomputability of state complexity for certain combined regularity-preserving operations.