1 citations · 5 across the 8 of their papers we have counts for
1 paper · 1 filter
Olivier Gauwin, Anca Muscholl, Michael Raskin
We show that the minimization of visibly pushdown automata is NP-complete. This result is obtained by introducing immersions, that recognize multiple languages (over a usual, non-v…