Nathan Grosshans

activity

20162023

most citedNondeterminism and an abstract formulation of Nečiporuk's lower bound method

3 citations · 5 across the 4 of their papers we have counts for

collaborators

Showing cs.FLShow all

2 papers · 1 filter

cs.FL2023★ 1 cited

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

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…

cs.FL2021

A Note on the Join of Varieties of Monoids with LI

Nathan Grosshans

In this note, we give a characterisation in terms of identities of the join of $V$ with the variety of finite locally trivial semigroups $LI$ for several well-kno…

The AC0-Complexity Of Visibly Pushdown Languages

A Note on the Join of Varieties of Monoids with LI

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