4 citations · 4 across the 1 of their papers we have counts for
1 paper
Sven Schneider, Uwe Nestmann
We present an algorithm which modifies a deterministic pushdown automaton (DPDA) such that (i) the marked language is preserved, (ii) lifelocks are removed, (iii) deadlocks are rem…