1 paper
Ayaan Bedi, Karoliina Lehtinen
We study explorability, a measure of nondeterminism in pushdown automata, which generalises history-determinism. An automaton is k-explorable if, while reading the input, it suffic…